Counting and cutting cycles of lines and rods in space
Authors:
- Micha SharirMSMicha Sharir
- Jack SnoeyinkJSJack Snoeyink
- 30 June 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (6) , 305-323
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Rigidity and polarityGeometriae Dedicata, 1989
- Output-sensitive hidden surface removal1989
- Extremal problems in discrete geometryCombinatorica, 1983
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980