Local polyhedra and geometric graphs

DOI10.1016/J.COMGEO.2004.08.004zbMATH Open1068.51023OpenAlexW4210283320MaRDI QIDQ1775780FDOQ1775780

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

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

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)

Cites Work

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

Cited In (12)

• On realistic terrains
• On the number of facets of three-dimensional Dirichlet stereohedra. IV: Quarter cubic groups
• Globally and locally convex polyhedra
• Local geometry of the 𝑘-curve graph
• Sigma-local graphs
• Local characterization of polyhedral spaces
• Decompositions and boundary coverings of non-convex fat polyhedra
• Local polyhedra and geometric graphs
• Title not available (Why is that?)
• Connect the Dot: Computing Feed-Links with Minimum Dilation
• Local Topological Parameters in a Tetrahedral Representation
• Title not available (Why is that?)

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)