V. Milenkovic

发表

Optimization-based animation

Victor J. Milenkovic, Harald Schmidl, V. Milenkovic, 2001, SIGGRAPH.

Compaction and separation algorithms for non-convex polygons and their applications☆

V. Milenkovic, Zhenyu Li, 1995 .

Robust Polygon Modeling

V. Milenkovic, 1993 .

Placement and compaction of nonconvex polygons for clothing manufacture

Wei Li Zhang, Victor Milenkovic, Karen Daniels, 1992 .

Towards Exact Geometric Computation

C. Yap, K. Sugihara, V. Milenkovic, 1994 .

A fast impulsive contact suite for rigid body simulation

Victor J. Milenkovic, Harald Schmidl, V. Milenkovic, 2004, IEEE Transactions on Visualization and Computer Graphics.

Finding the Largest Area Axis-parallel Rectangle in a Polygon

Dan Roth, Victor J. Milenkovic, Karen L. Daniels, 1997, Comput. Geom..

Translational polygon containment and minimal enclosure using mathematical programming

V. Milenkovic, Karen L. Daniels, 1999 .

Rounding Face Lattices in D Dimensions

V. Milenkovic, 1990 .

Rotational Polygon Overlap Minimization and Compaction 1

Victor J. Milenkovic, V. Milenkovic, 1998 .

An Inconsistency Sensitive Arrangement Algorithm for Algebraic Curves

V. Milenkovic, E. Sacks, 2004 .

Robust Polyhedral Minkowski Sums with GPU

V. Milenkovic, E. Sacks, M. Kyung, 2018 .

An Inconsistency Sensitive Arrangement Algorithm for Curve Segments

V. Milenkovic, E. Sacks, 2003 .

An Experiment Using LN for Exact Geometric Computations

Victor J. Milenkovic, Jacqueline D. Chang, V. Milenkovic, 1993, CCCG.

Limited Gaps

Victor J. Milenkovic, Karen L. Daniels, V. Milenkovic, 1994, CCCG.

Finding the largest rectangle in several classes of polygons

V. Milenkovic, Dan Roth, K. Daniels, 1995 .

Rendering Animations with Distributed Applets

Victor J. Milenkovic, Adam McMahon, V. Milenkovic, 2009, CGVR.

The Complexity of the Compaction Problem

Zhenyu Li, Victor J. Milenkovic, V. Milenkovic, 1993, CCCG.

Position based physics animating and packing spheres inside polyhedra

Victor J. Milenkovic, V. Milenkovic, 1995, CCCG.

Rotational polygon containment and minimum enclosure

Victor J. Milenkovic, V. Milenkovic, 1998, SCG '98.

Multiple Translational Containment Part II: Exact Algorithms

Victor J. Milenkovic, V. Milenkovic, 1997, Algorithmica.

Multiple Translational Containment Part I: An Approximate Algorithm

Victor J. Milenkovic, Karen L. Daniels, V. Milenkovic, 1997, Algorithmica.

Translational polygon containment and minimal enclosure using linear programming based restriction

Victor J. Milenkovic, V. Milenkovic, 1996, STOC '96.

Densest translational lattice packing of non-convex polygons

Victor J. Milenkovic, V. Milenkovic, 2002, Comput. Geom..

Rotational polygon containment and minimum enclosure using only robust 2D constructions

Victor J. Milenkovic, V. Milenkovic, 1999, Comput. Geom..

Column-Based Strip Packing Using Ordered and Compliant Containment

Victor J. Milenkovic, Karen L. Daniels, V. Milenkovic, 1996, WACG.

Multiple translational containment: approximate and exact algorithms

Victor J. Milenkovic, Karen L. Daniels, V. Milenkovic, 1995, SODA '95.

Robust polygon modelling

Victor J. Milenkovic, V. Milenkovic, 1993, Comput. Aided Des..

Robust Construction of the Voronoi Diagram of a Polyhedron

Victor J. Milenkovic, V. Milenkovic, 1993, CCCG.

Containment algorithms for nonconvex polygons with applications to layout

Victor Milenkovic, Karen Daniels, V. Milenkovic, 1995 .

Inverse Kinematics of Not Fully Serial Robot Linkages With Nonsingular Wrists

Victor Milenkovic, Veljko Milenkovic, Paul Milenkovic, 1991 .

Rotational polygon overlap minimization and compaction

Victor J. Milenkovic, V. Milenkovic, 1998, Comput. Geom..

Multiple resolution search techniques for the hough transform in high dimensional parameter spaces

Victor J. Milenkovic, V. Milenkovic, 1986 .

Minitrack Introduction

Veljko M. Milutinovic, Dragana Cvetkovic, Mirjana Simic, 2002, Hawaii International Conference on System Sciences.

Robust approximate assembly partitioning

Victor J. Milenkovic, Elisha Sacks, Yujun Wu, 2011, CCCG.

Asymptotically tight bounds for computing with faulty arrays of processors

Anna R. Karlin, Frank Thomson Leighton, Satish Rao, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Rational Orthogonal Approximations to Orthogonal Matrices

Victor J. Milenkovic, Veljko Milenkovic, V. Milenkovic, 1993, Comput. Geom..

Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic

Victor J. Milenkovic, V. Milenkovic, 1989, Artif. Intell..

Translational polygon containment and minimal enclosure using mathematical programming

V. Milenkovic, ProgrammingVictor J. Milenkovic, K. Daniels, 1999 .

Rotational polygon containment and minimum enclosure using only robust 2D constructions

V. Milenkovic, 1999, Comput. Geom..

Robust cascading of operations on polyhedra

Victor J. Milenkovic, Elisha Sacks, V. Milenkovic, 2014, Comput. Aided Des..

Numerical stability of algorithms for line arrangements

Victor J. Milenkovic, Steven Fortune, V. Milenkovic, 1991, SCG '91.

Finding compact coordinate representations for polygons and polyhedra

Victor J. Milenkovic, Lee R. Nackman, V. Milenkovic, 1990, SCG '90.

Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic

Victor J. Milenkovic, V. Milenkovic, 1989, 30th Annual Symposium on Foundations of Computer Science.

Rotational polygon containment and minimum enclosure

V. Milenkovic, 1998, SCG '98.