Results 1  10
of
30
Discrete Geometric Shapes: Matching, Interpolation, and Approximation: A Survey
 Handbook of Computational Geometry
, 1996
"... In this survey we consider geometric techniques which have been used to measure the similarity or distance between shapes, as well as to approximate shapes, or interpolate between shapes. Shape is a modality which plays a key role in many disciplines, ranging from computer vision to molecular biolog ..."
Abstract

Cited by 126 (10 self)
 Add to MetaCart
In this survey we consider geometric techniques which have been used to measure the similarity or distance between shapes, as well as to approximate shapes, or interpolate between shapes. Shape is a modality which plays a key role in many disciplines, ranging from computer vision to molecular biology. We focus on algorithmic techniques based on computational geometry that have been developed for shape matching, simplification, and morphing. 1 Introduction The matching and analysis of geometric patterns and shapes is of importance in various application areas, in particular in computer vision and pattern recognition, but also in other disciplines concerned with the form of objects such as cartography, molecular biology, and computer animation. The general situation is that we are given two objects A, B and want to know how much they resemble each other. Usually one of the objects may undergo certain transformations like translations, rotations or scalings in order to be matched with th...
Efficient algorithms for geometric optimization
 ACM Comput. Surv
, 1998
"... We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, pruneandsearch techniques for linear progra ..."
Abstract

Cited by 94 (12 self)
 Add to MetaCart
We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, pruneandsearch techniques for linear programming and related problems, and LPtype problems and their efficient solution. We then describe a variety of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other querytype problems.
Efficient Algorithms for Approximating Polygonal Chains
"... We consider the problem of approximating a polygonal chain C by another polygonal chain C ′ whose vertices are constrained to be a subset of the set of vertices of C. The goal is to minimize the number of vertices needed in the approximation C ′. Based on a framework introduced by Imai and Iri [25 ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
We consider the problem of approximating a polygonal chain C by another polygonal chain C ′ whose vertices are constrained to be a subset of the set of vertices of C. The goal is to minimize the number of vertices needed in the approximation C ′. Based on a framework introduced by Imai and Iri [25], we define an error criterion for measuring the quality of an approximation. We consider two problems. (1) Given a polygonal chain C and a parameter ε ≥ 0, compute an approximation of C, among all approximations whose error is at most ε, that has the smallest number of vertices. We present an O(n 4/3+δ)time algorithm to solve this problem, for any δ>0; the constant of proportionality in the running time depends on δ. (2) Given a polygonal chain C and an integer k, compute an approximation of C with at most k vertices whose error is the smallest among all approximations with at most k vertices. We present a simple randomized algorithm, with expected running time O(n 4/3+δ), to solve this problem.
Spaceefficient algorithms for approximating polygonal curves in twodimensional space
 Proc. 4th International Computing and Combinatorics Conf
, 1998
"... Given an nvertex polygonal curve P = [p 1, p 2, : ::, pn] in the 2dimensional space R 2, we consider the problem of approximating P by finding another polygonal curve P 0 ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
Given an nvertex polygonal curve P = [p 1, p 2, : ::, pn] in the 2dimensional space R 2, we consider the problem of approximating P by finding another polygonal curve P 0
Automatic Generation of Triangular Irregular Networks using Greedy Cuts
, 1995
"... We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimumlink paths in polygons. Our algorithm works by taking greedy cuts ("bites") out of a ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimumlink paths in polygons. Our algorithm works by taking greedy cuts ("bites") out of a simple closed polygon that bounds the yettobe triangulated region. The algorithm starts with a large polygon, bounding the whole extent of the terrain to be triangulated, and works its way inward, performing at each step one of three basic operations: ear cutting, greedy biting, and edge splitting. We give experimental evidence that our method is competitive with current algorithms and has the potential to be faster and to generate many fewer triangles. Also, it is able to keep the structural terrain fidelity at almost no extra cost in running time and it requires very little memory beyond that for the input height array. 1 Introduction A terrain is the graph of a function of two variabl...
Knowledge Discovery from Sequential Data
, 2003
"... A new framework for analyzing sequential or temporal data such as time series is proposed. It differs from other approaches by the special emphasis on the interpretability of the results, since interpretability is of vital importance for knowledge discovery, that is, the development of new knowl ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
A new framework for analyzing sequential or temporal data such as time series is proposed. It differs from other approaches by the special emphasis on the interpretability of the results, since interpretability is of vital importance for knowledge discovery, that is, the development of new knowledge (in the head of a human) from a list of discovered patterns. While traditional approaches try to model and predict all time series observations, the focus in this work is on modelling local dependencies in multivariate time series. This
Areapreserving approximations of polygonal paths
 Journal of Discrete Algorithms
, 2006
"... Let P be an xmonotone polygonal path in the plane. For a path Q that approximates P let WA(Q) be the area above P and below Q, and let WB(Q) be the area above Q and below P. Given P and an integer k, we show how to compute a path Q with at most k edges that minimizes WA(Q)+WB(Q). Given P and a cost ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Let P be an xmonotone polygonal path in the plane. For a path Q that approximates P let WA(Q) be the area above P and below Q, and let WB(Q) be the area above Q and below P. Given P and an integer k, we show how to compute a path Q with at most k edges that minimizes WA(Q)+WB(Q). Given P and a cost C, we show how to find a path Q with the smallest possible number of edges such that WA(Q) + WB(Q) ≤ C. However, given P, an integer k, and a cost C, it is NPhard to determine if a path Q with at most k edges exists such that max{WA(Q), WB(Q)} ≤ C. We describe an approximation algorithm for this setting. Finally, it is also NPhard to decide whether a path Q exists such that WA(Q) − WB(Q)  = 0. Nevertheless, in this error measure we provide an algorithm for computing an optimal approximation up to an additive error. 1
Path simplification for metro map layout
 Proc. 14th Internat. Sympos. Graph Drawing (GD’06), volume 4372 of Lecture
, 2006
"... Abstract. We investigate the problem of creating simplified representations of polygonal paths. Specifically, we look at a path simplification problem in which line segments of a simplification are required to conform with a restricted set of directions C. An algorithm is given to compute such simpl ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract. We investigate the problem of creating simplified representations of polygonal paths. Specifically, we look at a path simplification problem in which line segments of a simplification are required to conform with a restricted set of directions C. An algorithm is given to compute such simplified paths in O(C  3 n 2) time, where n is the number of vertices in the original path. This result is extended to produce an algorithm for graphs induced by multiple intersecting paths. The algorithm is applied to construct schematised representations of real world railway networks, in the style of metro maps. 1
Streaming Algorithms for Line Simplification
"... We study the following variant of the wellknown linesimplification problem: we are getting a possibly infinite sequence of points p0, p1, p2,... defining a polygonal path, and as we receive the points we wish to maintain a simplification of the path seen so far. We study this problem in a streamin ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We study the following variant of the wellknown linesimplification problem: we are getting a possibly infinite sequence of points p0, p1, p2,... defining a polygonal path, and as we receive the points we wish to maintain a simplification of the path seen so far. We study this problem in a streaming setting, where we only have a limited amount of storage so that we cannot store all the points. We analyze the competitive ratio of our algorithms, allowing resource augmentation: we let our algorithm maintain a simplification with 2k (internal) points, and compare the error of our simplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1) competitive ratio for three cases: convex paths where the error is measured using the Hausdorff distance, xymonotone paths where the error is measured using the Hausdorff distance, and general paths where the error is measured using the Fréchet distance. In the first case the algorithm needs O(k) additional storage, and in the latter two cases the algorithm needs O(k 2) additional storage. 1
Distancepreserving approximations of polygonal paths
 FST & TCS
, 2003
"... Given a polygonal path P with vertices p1, p2,..., pn ∈ Rd and a real number t ≥ 1, a path Q = (pi1, pi2,..., pik) is a tdistancepreserving approximation of P if 1 = i1 < i2 <... < ik = n and each straightline edge (pij, pij+1) of Q approximates the distance between pij and pij+1 along the path P ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Given a polygonal path P with vertices p1, p2,..., pn ∈ Rd and a real number t ≥ 1, a path Q = (pi1, pi2,..., pik) is a tdistancepreserving approximation of P if 1 = i1 < i2 <... < ik = n and each straightline edge (pij, pij+1) of Q approximates the distance between pij and pij+1 along the path P within a factor of t. We present exact and approximation algorithms that compute such a path Q that minimizes k (when given t) or t (when given k). We also present some experimental results. 1