Victor J. Milenkovic

Victor Milenkovic

	2012
i1		Victor Milenkovic, Elisha Sacks, Steven Trac: Planar shape manipulation using approximate geometric primitives. CoRR abs/1210.0607 (2012)
	2011
j16		Elisha Sacks, Victor Milenkovic, Min-Ho Kyung: Controlled linear perturbation. Computer-Aided Design 43(10): 1250-1257 (2011)
c26		Elisha Sacks, Victor Milenkovic, Yujun Wu: Robust approximate assembly partitioning. CCCG 2011
	2010
j15		Victor Milenkovic, Elisha Sacks: Two Approximate Minkowski Sum Algorithms. Int. J. Comput. Geometry Appl. 20(4): 485-509 (2010)
c25		Victor Milenkovic, Elisha Sacks, Min-Ho Kyung: Robust Minkowski sums of polyhedra via controlled linear perturbation. Symposium on Solid and Physical Modeling 2010: 23-30
	2009
c24		Adam McMahon, Victor Milenkovic: Rendering Animations with Distributed Applets. CGVR 2009: 136-142
	2007
j14		Victor Milenkovic, Elisha Sacks: An Approximate Arrangement Algorithm for Semi-Algebraic Curves. Int. J. Comput. Geometry Appl. 17(2): 175-198 (2007)
j13		Victor Milenkovic, Elisha Sacks: A Monotonic Convolution for Minkowski Sums. Int. J. Comput. Geometry Appl. 17(4): 383-396 (2007)
	2006
c23		Victor Milenkovic, Elisha Sacks: An approximate arrangement algorithm for semi-algebraic curves. Symposium on Computational Geometry 2006: 237-246
	2004
j12		Harald Schmidl, Victor J. Milenkovic: A Fast Impulsive Contact Suite for Rigid Body Simulation. IEEE Trans. Vis. Comput. Graph. 10(2): 189-197 (2004)
	2002
j11		Victor Milenkovic: Densest translational lattice packing of non-convex polygons. Comput. Geom. 22(1-3): 205-222 (2002)
	2001
c22		Victor Milenkovic, Harald Schmidl: Optimization-based animation. SIGGRAPH 2001: 37-46
	2000
j10		Victor Milenkovic: Shortest Path Geometric Rounding. Algorithmica 27(1): 57-86 (2000)
c21		Victor Milenkovic: Densest tanslational lattice packing of non-convex polygons (extended abstract). Symposium on Computational Geometry 2000: 280-289
	1999
j9		Victor Milenkovic: Rotational polygon containment and minimum enclosure using only robust 2D constructions. Comput. Geom. 13(1): 3-19 (1999)
	1998
j8		Victor Milenkovic: Rotational polygon overlap minimization and compaction. Comput. Geom. 10(4): 305-318 (1998)
c20		Victor Milenkovic: Rotational Polygon Containment and Minimum Enclosure. Symposium on Computational Geometry 1998: 1-8
	1997
j7		Karen L. Daniels, Victor Milenkovic: Multiple Translational Containment. Part I: An Approximate Algorithm. Algorithmica 19(1/2): 148-182 (1997)
j6		Victor Milenkovic: Multiple Translational Containment. Part II: Exact Algorithms. Algorithmica 19(1/2): 183-218 (1997)
j5		Victor J. Milenkovic, Veljko Milenkovic: Rational Orthogonal Approximations to Orthogonal Matrices. Comput. Geom. 7: 25-35 (1997)
j4		Karen L. Daniels, Victor J. Milenkovic, Dan Roth: Finding the Largest Area Axis-parallel Rectangle in a Polygon. Comput. Geom. 7: 125-148 (1997)
c19		Victor Milenkovic: Rotational Polygon Overlap Minimization. Symposium on Computational Geometry 1997: 334-343
	1996
c18		Karen L. Daniels, Victor J. Milenkovic: Distance-based Subdivision for Translational LP Containment. CCCG 1996: 196-201
c17		Victor Milenkovic: Position-Based Physics: Simulating the Motion of Many Highly Interacting Spheres and Polyhedra. SIGGRAPH 1996: 129-136
c16		Victor Milenkovic: Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. STOC 1996: 109-118
c15		Karen L. Daniels, Victor Milenkovic: Column-Based Strip Packing Using Ordered and Compliant Containment. WACG 1996: 91-107
	1995
c14		Karen L. Daniels, Victor Milenkovic: Multiple Translational Containment: Approximate and Exact Algorithms. SODA 1995: 205-214
	1994
c13		Karen L. Daniels, Victor Milenkovic: Limited Gaps. CCCG 1994: 225-230
	1993
j3		Victor Milenkovic: Robust polygon modelling. Computer-Aided Design 25(9): 546-566 (1993)
c12		Zhenyu Li, Victor Milenkovic: The Complexity of the Compaction Problem. CCCG 1993: 7-11
c11		Jacqueline D. Chang, Victor Milenkovic: An Experiment Using LN for Exact Geometric Computations. CCCG 1993: 67-78
c10		Karen L. Daniels, Victor Milenkovic, Dan Roth: Finding the Maximum Area Axis-parallel Rectangle in a Polygon. CCCG 1993: 322-327
c9		Victor Milenkovic: Robust Construction of the Voronoi Diagram of a Polyhedron. CCCG 1993: 473-478
c8		Victor Milenkovic, Veljko Milenkovic: Rational Orthogonal Approximations to Orthogonal Matrices. CCCG 1993: 485-490
c7		Zhenyu Li, Victor Milenkovic: A Compaction Algorithm for Non-Convex Polygons and Its Application. Symposium on Computational Geometry 1993: 153-162
	1992
j2		Zhenyu Li, Victor Milenkovic: Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. Algorithmica 8(5&6): 345-364 (1992)
	1991
c6		Steven Fortune, Victor Milenkovic: Numerical Stability of Algorithms for Line Arrangements. Symposium on Computational Geometry 1991: 334-341
	1990
c5		Zhenyu Li, Victor Milenkovic: Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. Symposium on Computational Geometry 1990: 235-243
c4		Victor Milenkovic, Lee R. Nackman: Finding Compact Coordinate Representations for Polygons and Polyhedra. Symposium on Computational Geometry 1990: 244-252
c3		Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas: Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract). FOCS 1990: 285-296
	1989
c2		Victor Milenkovic: Calculating Approximate Curve Arrangements Using Rounded Arithmetic. Symposium on Computational Geometry 1989: 197-207
c1		Victor Milenkovic: Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic. FOCS 1989: 500-505
	1988
j1		Victor Milenkovic: Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Artif. Intell. 37(1-3): 377-401 (1988)

Coauthor Index

Colors in the list of coauthors

Last update Sat May 25 05:47:31 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page