On point location and motion planning among simplices

DOI10.1145/195058.195112MaRDI QIDQ2817600zbMATH OpenOpenAlexFDO

Authors Marco Pellegrini

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195112

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On Point Location and Motion Planning among Simplices
• IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING
• On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
• Efficient Point Location in a Convex Spatial Cell-Complex
• scientific article; zbMATH DE number 140454

Cited in

(7)

• A robust backward search method based on walk-through for point location on a 3D surface mesh
• On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
• IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING
• On Point Location and Motion Planning among Simplices
• Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
• Finding simplices containing the origin in two and three dimensions
• On counting pairs of intersecting segments and off-line triangle range searching

This page was built for publication: On point location and motion planning among simplices

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