Polygonal path approximation with angle constraints

Authors:
Danny Z. Chen;Ovidiu Daescu;John Hershberger;Peter M. Kogge;Jack Snoeyink
Affiliations:
Dept. of Comp. Sci. and Eng., Univ. of Notre Dame, Notre Dame, IN;Dept. of Comp. Sci., Univ. of Texas at Dallas, Richardson, TX;Mentor Graphics, 8005 S.W. Boeckman Road, Wilsonville, OR;Dept. of Comp. Sci. and Eng., Univ. of Notre Dame, Notre Dame, IN;Dept. of Comp. Sci., Univ. of North Carolina at Chapel Hill, Chapel Hill, NC
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 2
Cited 3

Efficiently approximating polygonal paths in three and higher dimensions

Proceedings of the fourteenth annual symposium on Computational geometry
Curvature-constrained shortest paths in a convex polygon (extended abstract)

Proceedings of the fourteenth annual symposium on Computational geometry

Farthest-point queries with geometric and combinatorial constraints

Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints

Computational Geometry: Theory and Applications
Farthest-Point queries with geometric and combinatorial constraints

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present efficient geometric algorithms for several problems of approximating an n-vertex polygonal path with angle constraints in the d-D space for any fixed d ⪈ 2, improving significantly the corresponding graph- theoretic solutions based on known techniques (e.g., by (nearly) a factor of n for d = 2, 3). As a key step in our solutions, we formulate and solve an interesting problem called off-line ball exclusion search (OLBES), that may be of interest on its own.