Visibility, occlusion, and the aspect graph
International Journal of Computer Vision
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
On incremental rendering of silhouette maps of polyhedral scene
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Determining the lines through four lines
Journal of Graphics Tools
Robust Plane Sweep for Intersecting Segments
SIAM Journal on Computing
ACM Transactions on Graphics (TOG)
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Transversals to Line Segments in Three-Dimensional Space
Discrete & Computational Geometry
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing
On the Size of the 3D Visibility Skeleton: Experimental Results
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Lines through segments in 3d space
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
In this paper we study various geometric predicates for determining the existence of and categorizing the configurations of lines in 3D that are transversal to lines or segments. We compute the degrees of standard procedures of evaluating these predicates. The degrees of some of these procedures are surprisingly high (up to 168), which may explain why computing line transversals with finite-precision floating-point arithmetic is prone to error. Our results suggest the need to explore alternatives to the standard methods of computing these quantities.