Skip to Main content Skip to Navigation
New interface
Conference papers

Predicates for Line Transversals in 3D

Hazel Everett 1 Sylvain Lazard 1 Bill Lenhart 2 Jeremy Redburn 2 Linqiao Zhang 1 
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The degrees of some of these methods are surprisingly high, which may explain why computing line transversals with finite precision is prone to error. Our results suggest the need to explore alternatives to the standard methods of computing these quantities.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Sylvain Lazard Connect in order to contact the contributor
Submitted on : Thursday, October 5, 2006 - 3:23:47 PM
Last modification on : Saturday, November 19, 2022 - 3:59:05 AM
Long-term archiving on: : Thursday, September 20, 2012 - 11:16:31 AM


  • HAL Id : inria-00103945, version 1


Hazel Everett, Sylvain Lazard, Bill Lenhart, Jeremy Redburn, Linqiao Zhang. Predicates for Line Transversals in 3D. 18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada. ⟨inria-00103945⟩



Record views


Files downloads