Jeff Erickson
ABSTRACT
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant factor longer than the distance from v to its Euclidean nearest neighbor and (2) the lengths of the longest and shortest edges differ by at most a polynomial factor. A polyhedron is local if all its faces are simplices and its edges form a local geometric graph. We show that any boolean combination of any two local polyhedra in IRd, each with n vertices, can be computed in O(n log n) time, using a standard hierarchy of axis-aligned bounding boxes. Using results of de Berg, we also show that any local polyhedron in IRd has a binary space partition tree of size O(n logd-1 n). Finally, we describe efficient algorithms for computing Minkowski sums of local polyhedra in two and three dimensions.
- G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal. BOXTREE: A hierarchical representation for surfaces in 3D. Comput. Graph. Forum 15(3):C387--C396, C484, 1996. Proc. Eurographics'96.Google Scholar
Cross Ref
- M. de Berg. Linear size binary space partitions for uncluttered scenes. Algorithmica 28:353--366, 2000.Google ScholarDigital Library
- M. de Berg, M. Katz, M. Overmars, A. F. van der Stappen, and J. Vleugels. Models and motion planning. Proc. 6th Scand. Workshop Algorithm Theory, 83--94, 1998. Lecture Notes Comput. Sci. 1432, Springer-Verlag. Google ScholarDigital Library
- M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. Proc. 13th Annu. ACM Sympos. Comput. Geom., 294--303, 1997. Google ScholarDigital Library
- T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R trees. Proc. ACM SIGMOD Conf. on Management of Data, 237--246, 1993. Google ScholarDigital Library
- B. Chazelle. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J. Comput. 13:488--507, 1984. Google ScholarDigital Library
- B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir. Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11:116--132, 1994.Google ScholarDigital Library
- N. Chin and S. Feiner. Near real-time shadow generation using BSP trees. Comput. Graph. 23:99--106, 1989. Proc. SIGGRAPH '89. Google ScholarDigital Library
- N. Chin and S. Feiner. Fast object-precision shadow generation for areal light sources using BSP trees. Comput. Graph. 25:21--30, Mar. 1992. Proc. 1992 Sympos. Interactive 3D Graphics. Google ScholarDigital Library
- K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4:387--421, 1989.Google ScholarDigital Library
- J. Erickson. On the relative complexities of some geometric problems. Proc. 7th Canad. Conf. Comput. Geom., 85--90, 1995. http://www.uiuc.edu/~jeffe/pubs/relative.html.Google Scholar
- J. Erickson. New lower bounds for Hopcroft's problem. Discrete Comput. Geom. 16:389--418, 1996.Google ScholarDigital Library
- J. Erickson. Nice point sets can have nasty Delaunay triangulations. Proc. 17th Annu. ACM Sympos. Comput. Geom., 96--105, 2001. Full version to appear in Discrete Comput. Geom., 2003. Google ScholarDigital Library
- H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph. 14:124--133, 1980. Proc. SIGGRAPH '80. Google ScholarDigital Library
- S. Gottschalk, M. C. Lin, and D. Manocha. OBB-tree: A hierarchical structure for rapid interference detection. Comput. Graph. ??:171--180, 1996. Proc. SIGGRAPH '96. Google ScholarDigital Library
- L. Guibas, A. Nguyen, D. Russel, and L. Zhang. Collision detection for deforming necklaces. Proc. 18th Annu. ACM Sympos. Comput. Geom., 33--42, 2002. Google ScholarDigital Library
- A. Guttmann. R-trees:~A dynamic index structure for spatial searching. Proc. ACM SIGMOD Conf. on Management Data, 47--57, 1984. Google ScholarDigital Library
- H. H. Haverkort, M. de Berg, and J. Gudmundsson. Box-trees for collision checking in industrial applications. Proc. 18th Annu. ACM Sympos. Comput. Geom., 53---62, 2002. Google ScholarDigital Library
- P. M. Hubbard. Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Graph. 15(3):179--210, 1996. Google ScholarDigital Library
- J. Klosowski, M. Held, J. S. B. Mitchell, K. Zikan, and H. Sowizral. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. Visualizat. Comput. Graph. 4(1):21--36, 1998. Google ScholarDigital Library
- X.-Y. Li and S.-H. Teng. Generating well-shaped Delaunay meshes in 3D. Proc. 12th Annu. ACM SIAM Sympos. Discrete Algorithms, 28--37, 2001. Google ScholarDigital Library
- I. Lotan, F. Schwarzer, D. Halperin, and J.-C. Latombe. Efficient maintenance and self collision testing for kinematic chains. Proc. 18th Annu. ACM Sympos. Comput. Geom., 43--52, 2002. Google ScholarDigital Library
- G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. Proc. 27th Annu. ACM Sympos. Theory Comput., 683--692, 1995. Google ScholarDigital Library
- B. Mirtich and J. Canny. Impulse-based dynamic simulation. The Algorithmic Foundations of Robotics, 1995. A. K. Peters. Google ScholarDigital Library
- T. M. Murali and T. A. Funkhouser. Consistent solid and boundary representations from arbitrary polygonal data. Proc. 1997 Sympos. Interactive 3D Graphics, 1997. Google ScholarDigital Library
- B. Naylor, J. A. Amanatides, and W. Thibault. Merging BSP trees yields polyhedral set operations. Comput. Graph. 24:115--124, Aug. 1990. Proc. SIGGRAPH '90. Google ScholarDigital Library
- P. van Oosterom. An R-tree based map-overlay algorithm. Proc. EGIS '94, 318--327, 1994.Google Scholar
- M. H. Overmars and A. F. van der Stappen. Range searching and point location among fat objects. J. Algorithms 21:629--656, 1996. Google ScholarDigital Library
- M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom. 5:485--503, 1990.Google ScholarDigital Library
- M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms 13:99--113, 1992. Google ScholarDigital Library
- M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica 9:471--494, 1993.Google ScholarCross Ref
- O. Schwarzkopf and J. Vleugels. Range searching in low-density environments. Inform. Process. Lett. 60:121--127, 1996. Google ScholarDigital Library
- J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. Proc. 14th Annu. ACM Sympos. Comput. Geom., 86--95, 1998. Google ScholarDigital Library
- A. F. van~der Stappen. Motion Planning amidst Fat Obstacles. Ph.D. dissertation, Dept. Comput. Sci., Utrecht Univ., Utrecht, Netherlands, 1994.Google Scholar
- S. Suri, P. M. Hubbard, and J. F. Hughes. Collision detection in aspect and scale bounded polyhedra. Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 127--136, 1998. Google ScholarDigital Library
- E. Schomer and C. Thiel. Efficient collision detection for moving polyhedra. Proc. 11th Annu. ACM Sympos. Comput. Geom., 51--60, 1995. Google ScholarDigital Library
- R. A. Schumacker, R. Brand, M. Gilliland, and W. Sharp. Study for applying computer-generated images to visual simulation. Tech. Rep. AFHRL--TR--69--14, U.S. Air Force Human Resources Laboratory, 1969.Google ScholarCross Ref
- D. Talmor. Well-Spaced Points and Numerical Methods. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, August 1997. http://reports-archive.adm.cs.cmu.edu/anon/1997/abstracts/97-164.html. Technical report CMU-CS-97-164.Google Scholar
- S. J. Teller and C. H. Séquin. Visibility preprocessing for interactive walkthroughs Comput. Graph. 25(4): 61--69, 1991. Proc. SIGGRAPH '91. Google ScholarDigital Library
- S.-H. Teng. Points, Spheres, and Separators: A Unified Geometric Approach to Graph Partitioning. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1992. Technical report CMU-CS-91-184. Google ScholarDigital Library
- W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. Comput. Graph. 21:153--162, 1987. Proc. SIGGRAPH '87. Google ScholarDigital Library
- J. Vleugels. On Fatness and Fitness --- Realistic Input Models for Geometric Algorithms. Ph.D. thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands, 1997.Google Scholar
- Y. Zhou and S. Suri. Analysis of a bounding box heuristic for object intersection. Proc. 10th Annu. ACM-SIAM Sympos. Discrete Algorithms, 830--839, 1999. Google ScholarDigital Library
- A. Zomorodian and H. Edelsbrunner. Fast software for box intersection. Proc. 16th Annu. ACM Sympos. Comput. Geom., 129--138, 2000. Google ScholarDigital Library
Index Terms
- Local polyhedra and geometric graphs
Recommendations
Local polyhedra and geometric graphs
Special issue on the 19th annual symposium on computational geometry - SoCG 2003We introduce a new realistic input model for straight-line geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant factor longer than the distance from v to its Euclidean ...
Graphs of polyhedra; polyhedra as graphs
Relations between graph theory and polyhedra are presented in two contexts. In the first, the symbiotic dependence between 3-connected planar graphs and convex polyhedra is described in detail. In the second, a theory of nonconvex polyhedra is based on ...
Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
In 1922, Steinitz’s theorem gave a complete characterization of the topological structure of the vertices, edges, and faces of convex polyhedra as triconnected planar graphs. In this paper, we generalize Steinitz’s theorem to non-convex polyhedra. More ...
Comments