Papers by Victor Milenkovic
Peer Reviewed Articles and Exhibitions:

V. J. Milenkovic and E. Sacks.
An approximate arrangement algorithm for semialgebraic curves.
International Journal of
Computational Geometry and Applications.
In press.

H. Schmidl and V. J. Milenkovic. A Fast Impulsive Contact Suite
for Rigid Body Simulation. IEEE Transactions on Visualization
and Computer Graphics, 10(2):189197, MarchApril 2004.

V. J. Milenkovic
Densest translational lattice packing of
nonconvex polygons
Computational Geometry, 22:205222, 2002.

V. J. Milenkovic and Harald Schmidl.
Optimization Based Animation.
SIGGRAPH 2001 . Here is the
movie.

V. J. Milenkovic.
Shortest Path Geometric Rounding.
Algorithmica 27(1):5786, 2000.

V. J. Milenkovic and K. Daniels.
Translational Polygon Containment and
Minimal Enclosure using Mathematical Programming.
Transactions in Operational Research, 6:525554, 1999.

V. J. Milenkovic
Rotational polygon containment and minimum enclosure using only robust 2D constructions
Computational Geometry, 13(1):319, 1999.

V. J. Milenkovic
Rotational polygon overlap minimization and compaction
Computational Geometry, 10(4):305318, 1998.

K. M. Daniels and V. J. Milenkovic.
Multiple Translational
Containment. Part I: An Approximation Algorithm.
Algorithmica 19:148182, special issue on
Computational Geometry in Manufacturing, 1997.

V. J. Milenkovic.
Multiple Translational Containment, Part II: Exact
Algorithms.
Algorithmica 19:183218, special issue on
Computational Geometry in Manufacturing, 1997.

K. M. Daniels, V. J. Milenkovic, D. Roth.
Finding the Maximum Area AxisParallel Rectangle in a Simple
Polygon.
Computational Geometry: Theory and
Applications 7:125148, 1997.

V. J. Milenkovic and V. Milenkovic.
Rational Orthogonal Approximations to Orthogonal
Matrices.
Computational Geometry: Theory and
Applications 7:2535, 1997.

V. J. Milenkovic.
PositionBased Physics: Simulating the Motion of
Many Highly Interacting Spheres and Polyhedra.
Proceedings of SIGGRAPH '96,
Computer Graphics Proceedings, Annual Conference Series, August 1996,
pp. 129136.

Z. Li and V. J. Milenkovic.
Compaction and
Separation Algorithms for Nonconvex Polygons and Their
Applications.
European Journal of Operations Research,
84:539561, 1995.

V. J. Milenkovic.
Robust Polygon Modeling.
Special Issue of
ComputerAided Design on Uncertainties in Geometric
Computations, vol. 25, no. 9, September, 1993, pp. 546566.
Voted best paper of 1993 by editors.

V. J. Milenkovic and L. R. Nackman.
Finding Compact Coordinate
Representations for Polygons and Polyhedra.
IBM Journal of
Research and Development, vol. 34, no. 35, September 1990, pp.
753769.

Z. Li and V. J. Milenkovic.
Constructing Strongly Convex Hulls
Using Exact or Rounded Arithmetic.
Algorithmica, vol. 8
(1992), pp. 345364.

V. J. Milenkovic.
Verifiable Implementations of Geometric Algorithms
Using Finite Precision Arithmetic.
Artificial Intelligence , vol. 37
(1988), pp. 377401.
Refereed Conference Proceedings:

V. J. Milenkovic and E. Sacks.
An approximate arrangement algorithm for semialgebraic curves.
Proceedings of the 22th Annual
Symposium on Computational Geometry, ACM, June 2006.

V. J. Milenkovic.
Densest Translational Lattice Packing of NonConvex
Polygons.
Proceedings of the 16th Annual
Symposium on Computational Geometry, ACM, June 2000.

V. J. Milenkovic.
Rotational Polygon Containment and Minimum Enclosure.
Proceedings of the 14th Annual
Symposium on Computational Geometry, ACM, June 1998.

V. J. Milenkovic.
Rotational Polygon Overlap Minimization.
Proceedings of the 13th Annual
Symposium on Computational Geometry, ACM, Nice, France, June 46,
1997.

V. J. Milenkovic.
Translational Polygon Containment and Minimal
Enclosure using Linear Programming Based Restriction.
Proceedings of the 1996 ACM Symposium on the Theory of Computing
(STOC), May 2224, 1996, pp. 109118.

K. Daniels and V. J. Milenkovic.
ColumnBased Strip Packing using Ordered and Compliant
Containment.
Proceedings of the First ACM Workshop on Applied Computational
Geometry (WACG), edited by Ming C. Lin and Dinesh Manocha, May
2728, 1996, pp. 3338. (31 papers submitted, 12 accepted.)
Proceedings to appear as Lecture Notes in Computer Science,
SpringerVerlag.

K. M. Daniels and V. J. Milenkovic.
Multiple Translational Containment: Approximate and Exact
Algorithms.
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete
Algorithms (SODA), January 2224, 1995, pp. 205214.

Z. Li and V. J. Milenkovic.
A Compaction Algorithm for NonConvex
Polygons and Its Application.
Proceedings of the Ninth Annual
Symposium on Computational Geometry, ACM, San Diego, CA, May 1921,
1993, pp. 153162.

S. Fortune and V. J. Milenkovic.
Numerical Stability of Algorithms for
Line Arrangements.
Seventh Annual ACM Symposium on
Computational Geometry, North Conway, N.H., June 1012, 1991,
pp. 334341.

C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. J. Milenkovic, P.
Raghavan, S. Rao, C. Thomborson, and A. Tsantilas.
Asymptotically
Tight Bounds for Computing with Faulty Arrays of Processors.
31st Annual Symposium on the Foundations of Computer Science (FOCS), IEEE,
October 1990, pp. 285296.

V. Milenkovic, V. J. Milenkovic, and P. H. Milenkovic.
Inverse
Kinematics of Not Fully Serial Robot Linkages with NonSingular
Wrists.
Proceedings of the Robot Kinematics Workshop,
S. Stifter and J. Lenarcic, editors.
Research Institute for Symbolic Computation, Johannes Kepler
University, Linz, Austria, September 1990, pp. 335342.

Z. Li and V. J. Milenkovic.
Constructing Strongly Convex Hulls
Using Exact or Rounded Arithmetic.
Proceedings of the Sixth
Annual Symposium on Computational Geometry (SCG), Berkeley, California.
ACM Press, June 68, 1989, pp. 235243.

V. J. Milenkovic and L. R. Nackman.
Finding Compact Coordinate
Representations for Polygons and Polyhedra.
Proceedings of the
Sixth Annual Symposium on Computational Geometry (SCG), Berkeley,
California. ACM Press, June 68, 1989, pp. 244252.

V. J. Milenkovic.
Double Precision Geometry: A General Technique for Calculating Line
and Segment Intersections Using Rounded Arithmetic.
30th Annual
Symposium on the Foundations of Computer Science (FOCS), IEEE,
October 1989, pp. 500506.

V. J. Milenkovic.
Calculating Approximate Curve Arrangements Using Rounded
Arithmetic.
Proceedings of the Fifth ACM Symposium on Computational
Geometry, Saarbrucken, West Germany, June 57, 1989, pp. 197207.

V. J. Milenkovic.
Robust Geometric Computations for Vision and Robotics.
Proceedings of the DARPA Image Understanding Workshop, May, 1989,
pp. 764773.

V. J. Milenkovic and T. Kanade.
Trinocular Vision Using
Photometric and Edge Orientation Constraints.
Proceedings of the DARPA
Image Understanding Workshop, edited by Lee S. Baumann, December
1985, pp. 163175.
Book Chapters:

V. J. Milenkovic. Extending the Hough Transform to Higher
Dimensional Objects. Techniques for 3D Machine Perception,
edited by Azriel Rosenfeld and Laveen Kanal, published by
NorthHolland, 1986. pp. 231254.
Ph.D. Theses of Graduate Students

K. M. Daniels.
Containment Algorithms for Nonconvex Polygons with
Applications to Layout.
Technical Report TR1295, Center for Research in Computing
Technology, Division of Applied Sciences, Harvard University, May,
1995.

Z. Li.
Compaction Algorithms for NonConvex Polygons and Their Applications.
Technical Report TR1594, Center for Research in Computing
Technology, Division of Applied Sciences, Harvard University, May,
1994.
Technical Reports:

Victor Milenkovic and Elisha Sacks.
An inconsistency sensitive arrangement algorithm for algebraic curves.
Technical Report CSDTR 04017, Purdue University, June, 2004.

V. J. Milenkovic and K. M. Daniels.
Translational Polygon Containment and Minimal Enclosure using Geometric Algorithms and Mathematical Programming.
Technical Report TR2595, Center for
Research in Computing Technology, Division of Applied Sciences, Harvard
University, November, 1995.

K. M. Daniels, V. J. Milenkovic, and D. Roth.
Finding the Largest
Rectangle in Several Classes of Polygons.
Technical Report TR2295, Center for
Research in Computing Technology, Division of Applied Sciences, Harvard
University, September, 1995.

V. J. Milenkovic, K. M. Daniels, and Z. Li.
Multiple Containment Methods.
Technical Report TR1294, Center for
Research in Computing Technology, Division of Applied Sciences, Harvard
University, May, 1994.

V. J. Milenkovic. Verifiable Implementations of Geometric
Algorithms Using Finite Precision Arithmetic. Technical
Report CMUCS88168,
Department of Computer Science, Carnegie Mellon University,
Pittsburgh, PA, July 1988.
Conference Proceedings:

K. M. Daniels and V. J. Milenkovic.
DistanceBased Subdivision for Translational LP
Containment.
Proceedings of the Eighth Canadian Conference on Computational
Geometry, edited by Frank Fiala, Evangelos Kranakis, and
JorgRudiger Sack, Carleton University, Ottawa, Ontario, Canada,
August 1215, 1996, p. 196201.

V. J. Milenkovic.
Practical Methods for Set Operations on Polygons
using Exact Arithmetic.
Proceedings of the Seventh Canadian
Conference on Computational Geometry,
Laval University, Quebec, August, 1995, pp. 5560.

V. J. Milenkovic.
PositionBased Physics: Animating and Packing
Spheres inside Polyhedra.
Proceedings of the Seventh Canadian
Conference on Computational Geometry, Laval University, Quebec,
August, 1995, pp. 7984.

K. M. Daniels and V. J. Milenkovic.
Limited Gaps.
Proceedings of the Sixth Canadian Conference on Computational
Geometry, Mark Keil,
Ed., University of Saskatchewan, Saskatoon, Saskatchewan, Canada,
August 26, 1994, pp. 225230.

K. M. Daniels, V. J. Milenkovic, and D. Roth.
Finding the Largest
Rectangle in Several Classes of Polygons.
Proceedings of the Fifth Canadian Conference on Computational
Geometry, A. Lubiw and J. Urrutia Eds., University of Waterloo,
Ontario, Canada, August 59, 1993, pp. 322327.

V. J. Milenkovic.
Robust Construction of the Voronoi Diagram of a
Polyhedron.
Proceedings of the Fifth Canadian Conference on
Computational Geometry, A. Lubiw and J. Urrutia Eds., University of
Waterloo, Ontario, Canada, August 59, 1993, pp. 473478.

J. Chang and V. J. Milenkovic.
An Experiment Using LN
for Exact Geometric Computations.
Proceedings of the Fifth Canadian Conference on
Computational Geometry, A. Lubiw and J. Urrutia Eds., University of
Waterloo, Ontario, Canada, August 59, 1993, pp. 6772.

V. J. Milenkovic and V. Milenkovic.
Rational Orthogonal
Approximations to Orthogonal Matrices.
Proceedings of the Fifth Canadian Conference on
Computational Geometry, A. Lubiw and J. Urrutia Eds., University of
Waterloo, Ontario, Canada, August 59, 1993, pp. 485491.

Z. Li and V. J. Milenkovic.
The Complexity of the
Compaction Problem.
Proceedings of the Fifth Canadian Conference on
Computational Geometry, A. Lubiw and J. Urrutia Eds., University of
Waterloo, Ontario, Canada, August 59, 1993, pp. 711.

V. J. Milenkovic, K. M. Daniels, and Z. Li.
Placement and Compaction of NonConvex Polygons for Clothing
Manufacture.
Proceedings of the Fourth Canadian Conference on Computational
Geometry, C. A. Wang, Ed., Memorial University of Newfoundland,
St. John's, Newfoundland, Canada, August 1014, 1992, pp. 236243.

V. J. Milenkovic, K. M. Daniels, and Z. Li.
Automatic Marker Making.
Proceedings of the Third Canadian Conference on Computational
Geometry, T. Shermer, Ed., Simon Fraser University, Vancouver, B.C.,
August 610, 1991, pp. 243246.

V. J. Milenkovic.
Rounding Face Lattices in d Dimensions.
Proceedings of the
Second Canadian Conference on Computational Geometry, Jorge Urrutia,
Ed., University of Ottawa, Ontario, August 610, 1990, pp. 4045.

V. J. Milenkovic.
Rounding Face Lattices in the Plane.
First Canadian
Conference on Computational Geometry, Montreal, Quebec, Canada,
August 2125, 1989.
Victor Milenkovic / vjm@cs.miami.edu