Snap rounding line segments efficiently in two and three dimensions

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1997, Pages 284-293

  Goodrich, Michael T ^a   Hershberger, John ^a   Guibas, Leonidas J ^a   Tanenbaum, Paul J ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA;

GEOMETRIC ROUNDING; LINE SEGMENTS;

COMPUTATIONAL GEOMETRY;

EID: 0030644880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/262839.262985     Document Type: Conference Paper

References (23)