Gill Barequet
Michael T. Goodrich
- 1.H. ALT AND M. GODAU, Measuring the resemblance of polygonal curves, Proc. 8th Ann. A GM Syrup. on Computational Geometry, Berlin, Germany, 102-109, 1992. Google Scholar
Digital Library
- 2.E.M. ArtKIN, L.P. CHEW, D.P. HUTTENLOCHErt, K. KEDEM, AND J.S.B. MITCHELL, Aa efficiently computable metric for comparing polygonal shapes, IEEE Trans. on Pattern Analysis and Machine Intelligence, 13(3):209--216, 1991. Google ScholarDigital Library
- 3.B. BUTTENFIELD, Treatment of the cartographic line, Cartographic.a, 22:1-26, 1985.Google Scholar
- 4.W.S. CHAN AND F. CHIN, Approximation of polygonal curves vrith minimum number of line segments or minimum error, Int. J. of Computational Geometry and Applications, 6(1):59--77, 1996.Google ScholarCross Ref
- 5.B. CHAZELLE AND L.J. GUIBAS, Fractional cascading: I. A data structuring technique, Algorithmica, 1:133- 162, 1986.Google ScholarCross Ref
- 6.B. CHAZELLE AND L.J. GUmAS, Fractional cascading: II. Applications, Algorithmica, 1:163--191, 1986.Google ScholarCross Ref
- 7.D.Z. CHEN AND O. DAESCU, Space-efficient algorithms for appro#mating polygonal curves in two-dimensional space. Manuscript, 1997.Google Scholar
- 8.D.H. DOUGLAS AND T.K. PEUCKER, Algorithms for the reduction of the number of points required to represent a digitized line or its caricature, Canadian Car. tographer, 10(2):112-122, 1973.Google Scholar
- 9.J. EPJCKSON, Space-time tradeoffs for emptine# queries, Proc. 13th Ann. A CM Syrup. on Computa. #ional Geometry, Nice, France, 304-313, 1997. Google ScholarDigital Library
- 10.D. Eu AND G.T. TOUSSAINT, On appro#mation polygonal curves in two and three dimensions, CVGIP: Graphical Models and Image Processing, 56(3):231- 246, 1994. Google ScholarDigital Library
- 11.i#. FLEISCHER, K. MEHLHORN, (3. ROTE, E. WELZL, AND C.-K. YAP, SimultaneollS inner and outer approximation of shapes, Algorithmica, 8:365-389, 1992.Google ScholarDigital Library
- 12.hI.T. GOODRICH, Using approx4mation algorithms to design parallel algorithms that may ignore processor allocation. Proc. 32nd Ann. IEEE Syrup. on Foundations of Computer Science, San Juan, Puerto Rico, 711-722, 1991. Google ScholarDigital Library
- 13.M.T. GOODRICH AND R.TAMASSlA, Dynamic ray shooting and shortest paths via balanced geodesic triangulations, Proc. Yth Ann. A CM Syrup. on Computational Geometry, San Francisco, CA, 318-327, 1993. Google ScholarDigital Library
- 14.lkI.T. GOODRICH AND R. TAMASSIA, Dynamic trees and dynamic point location, SIAM J. Computing, to appear. Google ScholarDigital Library
- 15.L.J. GumAs, J.E. HERSItBERGER, J.S.B. MITCHELL, AND J.S. SNOE~1NK, Approx4mating polygons and subdivisions zith minimum link paths, Int. J. of Computational Geometry and Applications, 3(4):383-415, 1993.Google ScholarCross Ref
- 16.I. IH,# AN#) B. NAYLOR, Piecev.#ise linear approzdmations of digitized space curves with applications, in N. M. Patrikalatds (ed.), Scientific Visualization of Physical Phenomina, Springer-Verlag, Tokyo, 545-569, 1991. Google ScholarDigital Library
- 17.H. IMAI AND h'l. :{R.I, Computational-geometric methods for polygonal approx4mations of a curve, Computer Vision, Graphics, and Image Processing, 36:31- 41, 1986. Google ScholarDigital Library
- 18.H. IMAI AND #'#I. IRI, Polygonal approfimations of a curve-formulations and algorithms, Computational Morphology, 71-86, North-Holland, Amsterdam, 1988.Google Scholar
- 19.J. MAa'OU#EK AND O. SCHWARZKOPF, On ray shooting in convex polytopes, Discrete gJ Computational Geometry, 10:215-232, 1993.Google Scholar
- 20.hi. MCALLISTER AND J. SNOBYINK, h,Iedial azds generalisation of hydrology net#.orks, AutoOarto 13: A CSM/ASPRS Ann. Convention Technical Papers, Seattle, WA, 164-173, 1997.Google Scholar
- 21.N. MEOIDDO, Applying parallel computation algorithms in the design of serial algorithms, J. of the ACM, 30:852-865, 1983. Google ScholarDigital Library
- 22.A. #.,IELKMAN AND J. O'ROURKE, On polygonal chain approximation. Computational Morphology, 87- 95, North-Holland, Amsterdam, 1988.Google Scholar
- 23.B.K. NAT.#P,#.3AN, On comparing and compressing piecewise linear curves, Technical Report, Hewlett Packard, 1991.Google Scholar
- 24.B.K. NATARAJAN AND J. RUPPERT, On sparse approximations of curves and functions, Proc. 4th Canadian Conf. on Computational Geometry, 250--256, 1992.Google Scholar
- 25.G. ROTE, A new metric between polygom% and how to compute it, Proc. 19th Int. Colloq. Automata Lang. Program., Lecture Notes in Computer Science, 623:404-415, Springer-Verlag, 1992. Google ScholarDigital Library
- 26.hi. SH.#ma, A near-linear algorithm for the planar 2- center problem, Proc. 12th Ann. A GM Syrup. on Comp#ltational Geometry, Philadelphia, PA, 106-112, 1996. Google ScholarDigital Library
- 27.K.R. VAmXDAm#3AN, Approx4mating monotone polygonal curves using the uniform metric, Proc. 12th Ann. A GM Syrup. on Computational Geometry, Philadelphia, PA, 106-112, 1996. Google ScholarDigital Library
Index Terms
- Efficiently approximating polygonal paths in three and higher dimensions
Recommendations
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
We present efficient algorithms for solving polygonal-path approximation problems in three and higher dimensions. Given an n -vertex polygonal curve P in \Rd , d \geq 3 , we approximate P by another poly- gonal curve P' of m ≤ n vertices in \Rd such ...
On Approximating Shortest Paths in Weighted Triangular Tessellations
WALCOM: Algorithms and ComputationAbstractWe study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional space, we study three types ...
Approximating shortest paths on a convex polytope in three dimensions
Given a convex polytope P with n faces in ℝ3, points ∈ ∂P, and a parameter 0 < ϵ ≤ 1, we present an algorithm that constructs a path on ∂P from s to t whose length is at most (1 + ϵ)dp(s, t), where dp(s, t) is the length of the shortest path between s ...
Comments