Efficiently approximating polygonal paths in three and higher dimensions

Authors:
Gill Barequet;Michael T. Goodrich;D. Z. Chen;O. Daescu;J. Snoeyink
Affiliations:
Center for Geometric Computing, Dept. of Computer Science, Johns Hopkins University, Baltimore, MD;Center for Geometric Computing, Dept. of Computer Science, Johns Hopkins University, Baltimore, MD;Dept. of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Dept. of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Dept. of Computer Science, The University of British Columbia, 201-2366 Main Mall, Vanconver, B.C., Canada VOT 1Z4
Venue:
Proceedings of the fourteenth annual symposium on Computational geometry
Year:
1998

Citing 13
Cited 4

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
An Efficiently Computable Metric for Comparing Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Using approximation algorithms to design parallel algorithms that may ignore processor allocation (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Piecewise linear approximations of digitized space curves with applications

Scientific visualization of physical phenomena
Measuring the resemblance of polygonal curves

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Dynamic ray shooting and shortest paths via balanced geodesic triangulations

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On approximating polygonal curves in two and three dimensions

CVGIP: Graphical Models and Image Processing
A near-linear algorithm for the planar 2-center problem

Proceedings of the twelfth annual symposium on Computational geometry
Approximating monotone polygonal curves using the uniform metric

Proceedings of the twelfth annual symposium on Computational geometry
Space-time tradeoffs for emptiness queries (extended abstract)

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Dynamic Trees and Dynamic Point Location

SIAM Journal on Computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
A New Metric Between Polygons and How to Compute it

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming

Polygonal path approximation with angle constraints

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Simplification of surface annotations

Proceedings of the conference on Visualization '00
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Area-preserving approximations of polygonal paths

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Efficiently approximating polygonal paths in three and higher dimensions

Quantified Score

Visualization

Abstract