scientific article; zbMATH DE number 3926242

zbMATH Open0578.68036MaRDI QIDQ3700833FDOQ3700833

Authors: K. Mehlhorn, Klaus Simon 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• Optimal detection of intersections between convex polyhedra
• scientific article; zbMATH DE number 6789228
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
• A simple linear algorithm for intersecting convex polygons

zbMATH Keywords

computational geometryintersection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cited In (10)

• A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• Fast detection of polyhedral intersection
• Optimal detection of intersections between convex polyhedra
• A simple linear algorithm for intersecting convex polygons
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
• On ray shooting for triangles in 3-space and related problems
• EDGE ADVANCING RULES FOR INTERSECTING SPHERICAL CONVEX POLYGONS
• The shortest watchtower and related problems for polyhedral terrains
• An n log n algorithm for determining the congruity of polyhedra

This page was built for publication:

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