scientific article; zbMATH DE number 3926242

MaRDI QIDQ3700833zbMATH OpenFDO

Authors K. Mehlhorn, Klaus Simon

Publication date 1985

zbMATH Keywords

computational geometryintersection

Mathematics Subject Classification ID

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

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

Cited in

(10)

• A new O(n \,n) algorithm for computing the intersection of convex polygons
• Fast detection of polyhedral intersection
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• A simple linear algorithm for intersecting convex polygons
• Optimal detection of intersections between convex polyhedra
• 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)