Local polyhedra and geometric graphs

DOI10.1016/j.comgeo.2004.08.004zbMath1068.51023OpenAlexW4210283320MaRDI QIDQ1775780

Jeff Erickson

Publication date: 4 May 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.08.004

zbMATH Keywords

geometric graphMinkowski sumbinary space partitioninput modelintersection detectionbounding volume hierarchyBoolean combination

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Algorithms in computer science (68W99)

Related Items (6)

Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ Unnamed Item ⋮ On realistic terrains ⋮ Sigma-local graphs ⋮ On the number of facets of three-dimensional Dirichlet stereohedra. IV: Quarter cubic groups ⋮ Decompositions and boundary coverings of non-convex fat polyhedra

Uses Software

• Stanford 3D Scanning Repository

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collision detection for deforming necklaces
• Efficient binary space partitions for hidden-surface removal and solid modeling
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Range searching in low-density environments
• Nice point sets can have nasty Delaunay triangulations
• Linear size binary space partitions for uncluttered scenes
• New lower bounds for Hopcroft's problem
• Applications of random sampling in computational geometry. II
• The complexity of the free space for motion planning amidst fat obstacles
• Ray shooting on triangles in 3-space
• Analysis of a bounding box heuristic for object intersection
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• A new approach to rectangle intersections part I
• Range Searching and Point Location among Fat Objects
• Lower bounds for algebraic decision trees
• Counting and Reporting Intersections of d-Ranges
• Optimal binary space partitions for orthogonal objects
• Lectures on Polytopes
• Collision detection for deforming necklaces
• Efficient maintenance and self-collision testing for Kinematic Chains
• Box-trees for collision checking in industrial installations
• FAST SOFTWARE FOR BOX INTERSECTIONS
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Models and motion planning
• OVERLAYING SURFACE MESHES, PART I: ALGORITHMS

This page was built for publication: Local polyhedra and geometric graphs