Search the dblp DataBase
Victor Milenkovic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Zhenyu Li, Victor Milenkovic
The Complexity of the Compaction Problem. [Citation Graph (0, 0)][DBLP]
CCCG, 1993, pp:7-11 [Conf] - Karen L. Daniels, Victor Milenkovic
Limited Gaps. [Citation Graph (0, 0)][DBLP]
CCCG, 1994, pp:225-230 [Conf] - Karen L. Daniels, Victor Milenkovic, Dan Roth
Finding the Maximum Area Axis-parallel Rectangle in a Polygon. [Citation Graph (0, 0)][DBLP]
CCCG, 1993, pp:322-327 [Conf] - Jacqueline D. Chang, Victor Milenkovic
An Experiment Using LN for Exact Geometric Computations. [Citation Graph (0, 0)][DBLP]
CCCG, 1993, pp:67-78 [Conf] - Victor Milenkovic
Robust Construction of the Voronoi Diagram of a Polyhedron. [Citation Graph (0, 0)][DBLP]
CCCG, 1993, pp:473-478 [Conf] - Victor Milenkovic, Veljko Milenkovic
Rational Orthogonal Approximations to Orthogonal Matrices. [Citation Graph (0, 0)][DBLP]
CCCG, 1993, pp:485-490 [Conf] - Zhenyu Li, Victor Milenkovic
Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1990, pp:235-243 [Conf] - Zhenyu Li, Victor Milenkovic
A Compaction Algorithm for Non-Convex Polygons and Its Application. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1993, pp:153-162 [Conf] - Steven Fortune, Victor Milenkovic
Numerical Stability of Algorithms for Line Arrangements. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1991, pp:334-341 [Conf] - Victor Milenkovic
Densest tanslational lattice packing of non-convex polygons (extended abstract). [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2000, pp:280-289 [Conf] - Victor Milenkovic
Calculating Approximate Curve Arrangements Using Rounded Arithmetic. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1989, pp:197-207 [Conf] - Victor Milenkovic
Rotational Polygon Overlap Minimization. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1997, pp:334-343 [Conf] - Victor Milenkovic
Rotational Polygon Containment and Minimum Enclosure. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1998, pp:1-8 [Conf] - Victor Milenkovic, Lee R. Nackman
Finding Compact Coordinate Representations for Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1990, pp:244-252 [Conf] - Victor Milenkovic, Elisha Sacks
An approximate arrangement algorithm for semi-algebraic curves. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2006, pp:237-246 [Conf] - 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) [Citation Graph (0, 0)][DBLP]
FOCS, 1990, pp:285-296 [Conf] - Victor Milenkovic
Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic [Citation Graph (0, 0)][DBLP]
FOCS, 1989, pp:500-505 [Conf] - Victor Milenkovic
Position-Based Physics: Simulating the Motion of Many Highly Interacting Spheres and Polyhedra. [Citation Graph (0, 0)][DBLP]
SIGGRAPH, 1996, pp:129-136 [Conf] - Victor Milenkovic, Harald Schmidl
Optimization-based animation. [Citation Graph (0, 0)][DBLP]
SIGGRAPH, 2001, pp:37-46 [Conf] - Karen Daniels, Victor Milenkovic
Multiple Translational Containment: Approximate and Exact Algorithms. [Citation Graph (0, 0)][DBLP]
SODA, 1995, pp:205-214 [Conf] - Victor Milenkovic
Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. [Citation Graph (0, 0)][DBLP]
STOC, 1996, pp:109-118 [Conf] - Karen Daniels, Victor Milenkovic
Column-Based Strip Packing Using Ordered and Compliant Containment. [Citation Graph (0, 0)][DBLP]
WACG, 1996, pp:91-107 [Conf] - Victor Milenkovic
Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 1988, v:37, n:1-3, pp:377-401 [Journal] - Karen Daniels, Victor Milenkovic
Multiple Translational Containment. Part I: An Approximate Algorithm. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1997, v:19, n:1/2, pp:148-182 [Journal] - Zhenyu Li, Victor Milenkovic
Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1992, v:8, n:5&6, pp:345-364 [Journal] - Victor Milenkovic
Shortest Path Geometric Rounding. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2000, v:27, n:1, pp:57-86 [Journal] - Victor Milenkovic
Multiple Translational Containment. Part II: Exact Algorithms. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1997, v:19, n:1/2, pp:183-218 [Journal] - Victor Milenkovic
Robust polygon modelling. [Citation Graph (0, 0)][DBLP]
Computer-Aided Design, 1993, v:25, n:9, pp:546-566 [Journal] - Victor Milenkovic
Densest translational lattice packing of non-convex polygons. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2002, v:22, n:1-3, pp:205-222 [Journal] - Victor Milenkovic
Rotational polygon overlap minimization and compaction. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1998, v:10, n:4, pp:305-318 [Journal] - Victor Milenkovic
Rotational polygon containment and minimum enclosure using only robust 2D constructions. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1999, v:13, n:1, pp:3-19 [Journal]
Rendering Animations with Distributed Applets. [Citation Graph (, )][DBLP]
Robust Minkowski sums of polyhedra via controlled linear perturbation. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.302secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002