Victor J. Milenkovic

Victor Milenkovic

	2009
38		Adam McMahon, Victor Milenkovic: Rendering Animations with Distributed Applets. CGVR 2009: 136-142
	2007
37		Victor Milenkovic, Elisha Sacks: An Approximate Arrangement Algorithm for Semi-Algebraic Curves. Int. J. Comput. Geometry Appl. 17(2): 175-198 (2007)
36		Victor Milenkovic, Elisha Sacks: A Monotonic Convolution for Minkowski Sums. Int. J. Comput. Geometry Appl. 17(4): 383-396 (2007)
	2006
35		Victor Milenkovic, Elisha Sacks: An approximate arrangement algorithm for semi-algebraic curves. Symposium on Computational Geometry 2006: 237-246
	2004
34		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
33		Victor Milenkovic: Densest translational lattice packing of non-convex polygons. Comput. Geom. 22(1-3): 205-222 (2002)
	2001
32		Victor Milenkovic, Harald Schmidl: Optimization-based animation. SIGGRAPH 2001: 37-46
	2000
31		Victor Milenkovic: Densest tanslational lattice packing of non-convex polygons (extended abstract). Symposium on Computational Geometry 2000: 280-289
30		Victor Milenkovic: Shortest Path Geometric Rounding. Algorithmica 27(1): 57-86 (2000)
	1999
29		Victor Milenkovic: Rotational polygon containment and minimum enclosure using only robust 2D constructions. Comput. Geom. 13(1): 3-19 (1999)
	1998
28		Victor Milenkovic: Rotational Polygon Containment and Minimum Enclosure. Symposium on Computational Geometry 1998: 1-8
27		Victor Milenkovic: Rotational polygon overlap minimization and compaction. Comput. Geom. 10(4): 305-318 (1998)
	1997
26		Victor Milenkovic: Rotational Polygon Overlap Minimization. Symposium on Computational Geometry 1997: 334-343
25		Karen Daniels, Victor Milenkovic: Multiple Translational Containment. Part I: An Approximate Algorithm. Algorithmica 19(1/2): 148-182 (1997)
24		Victor Milenkovic: Multiple Translational Containment. Part II: Exact Algorithms. Algorithmica 19(1/2): 183-218 (1997)
23		Karen L. Daniels, Victor J. Milenkovic, Dan Roth: Finding the Largest Area Axis-parallel Rectangle in a Polygon. Comput. Geom. 7: 125-148 (1997)
22		Victor J. Milenkovic, Veljko Milenkovic: Rational Orthogonal Approximations to Orthogonal Matrices. Comput. Geom. 7: 25-35 (1997)
	1996
21		Karen L. Daniels, Victor J. Milenkovic: Distance-based Subdivision for Translational LP Containment. CCCG 1996: 196-201
20		Victor Milenkovic: Position-Based Physics: Simulating the Motion of Many Highly Interacting Spheres and Polyhedra. SIGGRAPH 1996: 129-136
19		Victor Milenkovic: Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. STOC 1996: 109-118
18		Karen Daniels, Victor Milenkovic: Column-Based Strip Packing Using Ordered and Compliant Containment. WACG 1996: 91-107
	1995
17		Karen Daniels, Victor Milenkovic: Multiple Translational Containment: Approximate and Exact Algorithms. SODA 1995: 205-214
	1994
16		Karen L. Daniels, Victor Milenkovic: Limited Gaps. CCCG 1994: 225-230
	1993
15		Karen L. Daniels, Victor Milenkovic, Dan Roth: Finding the Maximum Area Axis-parallel Rectangle in a Polygon. CCCG 1993: 322-327
14		Victor Milenkovic: Robust Construction of the Voronoi Diagram of a Polyhedron. CCCG 1993: 473-478
13		Victor Milenkovic, Veljko Milenkovic: Rational Orthogonal Approximations to Orthogonal Matrices. CCCG 1993: 485-490
12		Jacqueline D. Chang, Victor Milenkovic: An Experiment Using LN for Exact Geometric Computations. CCCG 1993: 67-78
11		Zhenyu Li, Victor Milenkovic: The Complexity of the Compaction Problem. CCCG 1993: 7-11
10		Zhenyu Li, Victor Milenkovic: A Compaction Algorithm for Non-Convex Polygons and Its Application. Symposium on Computational Geometry 1993: 153-162
9		Victor Milenkovic: Robust polygon modelling. Computer-Aided Design 25(9): 546-566 (1993)
	1992
8		Zhenyu Li, Victor Milenkovic: Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. Algorithmica 8(5&6): 345-364 (1992)
	1991
7		Steven Fortune, Victor Milenkovic: Numerical Stability of Algorithms for Line Arrangements. Symposium on Computational Geometry 1991: 334-341
	1990
6		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
5		Zhenyu Li, Victor Milenkovic: Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. Symposium on Computational Geometry 1990: 235-243
4		Victor Milenkovic, Lee R. Nackman: Finding Compact Coordinate Representations for Polygons and Polyhedra. Symposium on Computational Geometry 1990: 244-252
	1989
3		Victor Milenkovic: Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic FOCS 1989: 500-505
2		Victor Milenkovic: Calculating Approximate Curve Arrangements Using Rounded Arithmetic. Symposium on Computational Geometry 1989: 197-207
	1988
1		Victor Milenkovic: Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Artif. Intell. 37(1-3): 377-401 (1988)

Coauthor Index

1	Jacqueline D. Chang	[12]
2	Karen Daniels	[17] [18] [25]
3	Karen L. Daniels	[15] [16] [21] [23]
4	Steven Fortune	[7]
5	Christos Kaklamanis	[6]
6	Anna R. Karlin	[6]
7	Frank Thomson Leighton (Tom Leighton)	[6]
8	Zhenyu Li	[5] [8] [10] [11]
9	Adam McMahon	[38]
10	Veljko Milenkovic	[13] [22]
11	Lee R. Nackman	[4]
12	Prabhakar Raghavan	[6]
13	Satish Rao	[6]
14	Dan Roth	[15] [23]
15	Elisha Sacks	[35] [36] [37]
16	Harald Schmidl	[32] [34]
17	Clark D. Thomborson (Clark D. Thompson)	[6]
18	A. Tsantilas	[6]

Colors in the list of coauthors