default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor J. Milenkovic
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Victor Milenkovic
, Elisha Sacks:
Efficient Predicate Evaluation Using Randomized Degeneracy Detection. Int. J. Comput. Geom. Appl. 32(1&2): 39-54 (2022)- [c34]Victor Milenkovic, Elisha Sacks:
Efficient Predicate Evaluation using Statistical Degeneracy Detection. CCCG 2022: 235-242
2010 – 2019
- 2019
- [j23]Victor Milenkovic, Elisha Sacks:
Geometric rounding and feature separation in meshes. Comput. Aided Des. 108: 12-18 (2019) - [j22]Victor Milenkovic, Elisha Sacks, Nabeel Butt:
Fast Detection of Degenerate Predicates in Free Space Construction. Int. J. Comput. Geom. Appl. 29(3): 219-237 (2019) - 2018
- [c33]Joseph Masterjohn, Victor Milenkovic, Elisha Sacks:
Finding Intersections of Algebraic curves in a Convex Region using Encasement. CCCG 2018: 91-97 - [c32]Chloe Arluck, Victor Milenkovic, Elisha Sacks:
Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom Robot. CCCG 2018: 223-229 - [c31]Victor Milenkovic, Elisha Sacks, Nabeel Butt:
Table Based Detection of Degenerate Predicates in Free Space Construction. SoCG 2018: 61:1-61:14 - [i3]Victor Milenkovic, Elisha Sacks, Nabeel Butt:
Table Based Detection of Degenerate Predicates in Free Space Construction. CoRR abs/1803.06908 (2018) - [i2]Victor Milenkovic, Elisha Sacks:
Geometric Rounding and Feature Separation in Meshes. CoRR abs/1805.03252 (2018) - 2017
- [j21]Elisha Sacks, Nabeel Butt, Victor Milenkovic:
Robust free space construction for a polyhedron with planar motion. Comput. Aided Des. 90: 18-26 (2017) - 2015
- [j20]Min-Ho Kyung, Elisha Sacks, Victor Milenkovic:
Robust polyhedral Minkowski sums with GPU implementation. Comput. Aided Des. 67-68: 48-57 (2015) - 2014
- [j19]Elisha Sacks, Victor Milenkovic:
Robust cascading of operations on polyhedra. Comput. Aided Des. 46: 216-220 (2014) - 2013
- [j18]Victor Milenkovic, Elisha Sacks, Steven Trac:
Planar Shape Manipulation using Approximate Geometric Primitives. Int. J. Comput. Geom. Appl. 23(1): 1-28 (2013) - [j17]Victor Milenkovic, Elisha Sacks, Steven Trac:
Robust Free Space Computation for Curved Planar Bodies. IEEE Trans Autom. Sci. Eng. 10(4): 875-883 (2013) - [c30]Justin Stoecker, Victor Milenkovic:
Interactive visualization of 3D configuration spaces. SoCG 2013: 341-342 - 2012
- [c29]Victor Milenkovic, Elisha Sacks, Steven Trac:
Robust Complete Path Planning in the Plane. WAFR 2012: 37-52 - [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. Comput. Aided Des. 43(10): 1250-1257 (2011) - [c28]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. Geom. Appl. 20(4): 485-509 (2010) - [c27]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
2000 – 2009
- 2009
- [c26]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. Geom. Appl. 17(2): 175-198 (2007) - [j13]Victor Milenkovic, Elisha Sacks:
A Monotonic Convolution for Minkowski Sums. Int. J. Comput. Geom. Appl. 17(4): 383-396 (2007) - 2006
- [c25]Victor Milenkovic, Elisha Sacks:
An approximate arrangement algorithm for semi-algebraic curves. SCG 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
- [c24]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) - [c23]Victor Milenkovic:
Densest tanslational lattice packing of non-convex polygons (extended abstract). SCG 2000: 280-289
1990 – 1999
- 1999
- [j9]Victor Milenkovic:
Rotational polygon containment and minimum enclosure using only robust 2D constructions. Comput. Geom. 13(1): 3-19 (1999) - [e1]Victor Milenkovic:
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999. ACM 1999, ISBN 1-58113-068-6 [contents] - 1998
- [j8]Victor Milenkovic:
Rotational polygon overlap minimization and compaction. Comput. Geom. 10(4): 305-318 (1998) - [c22]Victor Milenkovic:
Rotational Polygon Containment and Minimum Enclosure. SCG 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) - [c21]Victor Milenkovic:
Rotational Polygon Overlap Minimization. SCG 1997: 334-343 - 1996
- [c20]Karen L. Daniels, Victor J. Milenkovic:
Distance-based Subdivision for Translational LP Containment. CCCG 1996: 196-201 - [c19]Victor Milenkovic:
Position-Based Physics: Simulating the Motion of Many Highly Interacting Spheres and Polyhedra. SIGGRAPH 1996: 129-136 - [c18]Victor Milenkovic:
Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. STOC 1996: 109-118 - [c17]Karen L. Daniels, Victor Milenkovic:
Column-Based Strip Packing Using Ordered and Compliant Containment. WACG 1996: 91-107 - 1995
- [c16]Victor J. Milenkovic:
Practical methods for set operations on polygons using exact arithmetic. CCCG 1995: 55-60 - [c15]Victor Milenkovic:
Position based physics animating and packing spheres inside polyhedra. CCCG 1995: 79-84 - [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. Comput. Aided Des. 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. SCG 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. SCG 1991: 334-341 - 1990
- [c5]Zhenyu Li, Victor Milenkovic:
Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. SCG 1990: 235-243 - [c4]Victor Milenkovic, Lee R. Nackman:
Finding Compact Coordinate Representations for Polygons and Polyhedra. SCG 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
1980 – 1989
- 1989
- [c2]Victor Milenkovic:
Calculating Approximate Curve Arrangements Using Rounded Arithmetic. SCG 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
