Infimaximal Frames: A Technique for Making Lines Look Like Segments

DOI10.1142/S0218195903001141zbMath1093.68131MaRDI QIDQ4818582

Michael Seel, Kurt Mehlhorn

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

plane sweepNef polyhedrapoints at infinityCGALinfimaximal frames

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ On the computation of an arrangement of quadrics in 3D

Uses Software

• LEDA

Cites Work

• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Infimaximal Frames: A Technique for Making Lines Look Like Segments