Local polyhedra and geometric graphs

DOI10.1016/J.COMGEO.2004.08.004MaRDI QIDQ1775780zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Local polyhedra and geometric graphs
• Local properties of geometric graphs
• The Union of Convex Polyhedra in Three Dimensions
• Storing the subdivision of a polyhedral surface
• Sigma-local graphs

Cites work

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

Cited in

(12)

• Decompositions and boundary coverings of non-convex fat polyhedra
• Connect the Dot: Computing Feed-Links with Minimum Dilation
• On realistic terrains
• Globally and locally convex polyhedra
• Local characterization of polyhedral spaces
• Local Topological Parameters in a Tetrahedral Representation
• Local geometry of the 𝑘-curve graph
• scientific article; zbMATH DE number 29204 (Why is no real title available?)
• On the number of facets of three-dimensional Dirichlet stereohedra. IV: Quarter cubic groups
• Sigma-local graphs
• Local polyhedra and geometric graphs
• \((1+\varepsilon)\)-ANN data structure for curves via subspaces of bounded doubling dimension

Describes a project that uses

Uses Software

• Stanford 3D Scanning Repository

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775780)