On the degree of standard geometric predicates for line transversals in 3D

DOI10.1016/j.comgeo.2007.11.002zbMath1169.65016OpenAlexW2049799129MaRDI QIDQ1025306

Linqiao Zhang, Hazel Everett, Sylvain Lazard, William J. Lenhart

Publication date: 18 June 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00431441/file/CGTA_revised.pdf

zbMATH Keywords

robustnesscomputational geometryPlücker coordinatesline transversals3 D visibility

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs

Uses Software

• CGAL

Cites Work

• Towards exact geometric computation
• Transversals to line segments in three-dimensional space
• When Close Enough is Close Enough
• Identification of algebraic numbers
• Robust Plane Sweep for Intersecting Segments
• The computational geometry algorithms library CGAL
• Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
• Unnamed Item
• Unnamed Item

This page was built for publication: On the degree of standard geometric predicates for line transversals in 3D