Results 1  10
of
61,902
Computing the Detour of Polygonal Curves
, 2002
"... Let P be a simple polygonal chain in E with n edges. The detour of P between two points, x and y, is the ratio between the length of P between x any y and their Euclidean distance. The detour ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Let P be a simple polygonal chain in E with n edges. The detour of P between two points, x and y, is the ratio between the length of P between x any y and their Euclidean distance. The detour
Reconstruction and smoothing of polygonal curves
, 2005
"... In this paper we propose a method for piecewise linear reconstruction and subsequent smoothing of a point sampled curve. The reconstruction step is based on the meshless parameterization reconstruction algorithm proposed by Floater. The information computed in the reconstruction step is used for a l ..."
Abstract
 Add to MetaCart
In this paper we propose a method for piecewise linear reconstruction and subsequent smoothing of a point sampled curve. The reconstruction step is based on the meshless parameterization reconstruction algorithm proposed by Floater. The information computed in the reconstruction step is used for a
The size of spanning disks for polygonal curves
 Discrete Comput. Geom
"... Abstract. For each integer n ≥ 0, there is a closed, unknotted, polygonal curve Kn in R 3 having less than 10n + 9 edges, with the property that any PiecewiseLinear triangulated disk spanning the curve contains at least 2 n−1 triangles. 1. Introduction. Let K be a closed polygonal curve in R3 consi ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract. For each integer n ≥ 0, there is a closed, unknotted, polygonal curve Kn in R 3 having less than 10n + 9 edges, with the property that any PiecewiseLinear triangulated disk spanning the curve contains at least 2 n−1 triangles. 1. Introduction. Let K be a closed polygonal curve in R3
Similarity of Polygonal Curves in the Presence of Outliers
, 2014
"... The Fréchet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of outliers. Since the presence of outliers is a frequently occurring phenomenon in practice, a robust variant of Fréchet d ..."
Abstract
 Add to MetaCart
The Fréchet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of outliers. Since the presence of outliers is a frequently occurring phenomenon in practice, a robust variant of Fréchet
Approximately Matching Polygonal Curves with Respect to the Fréchet Distance
 of Computational Geometry: Theory and Applications., (Special Issue on the 19th Europ. Workshop on Comp. Geom
, 2003
"... In this paper we present approximate algorithms for matching two polygonal curves with respect to the Frechet distance. We define a discrete version of the Frechet distance as a distance measure between polygonal curves and show that this discrete version is bounded by the continuous version of t ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this paper we present approximate algorithms for matching two polygonal curves with respect to the Frechet distance. We define a discrete version of the Frechet distance as a distance measure between polygonal curves and show that this discrete version is bounded by the continuous version
HellyType Theorems for Polygonal Curves
 Discrete Math
, 2002
"... We prove the following intersection and covering Hellytype theorems for boundaries of convex polygons in the plane. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We prove the following intersection and covering Hellytype theorems for boundaries of convex polygons in the plane.
Probabilistic matching of sets of Polygonal curves
 Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), 107–110
, 2006
"... Analysis and comparison of geometric shapes are of importance in various application areas within computer science, e.g., pattern recognition and computer vision. The general situation in a shape matching ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Analysis and comparison of geometric shapes are of importance in various application areas within computer science, e.g., pattern recognition and computer vision. The general situation in a shape matching
Approximation of polygonal curves with minimum number of biarcs
"... An algorithm for approximating a given open polygonal curve with a minimum number of biarcs is introduced. In computeraided manufacturing environments, the paths of cutting tools are usually described with circular arcs and straight line segments. Greedy algorithms for approximating a polygonal cu ..."
Abstract
 Add to MetaCart
An algorithm for approximating a given open polygonal curve with a minimum number of biarcs is introduced. In computeraided manufacturing environments, the paths of cutting tools are usually described with circular arcs and straight line segments. Greedy algorithms for approximating a polygonal
SIMPLIPOLY: CURVATUREBASED POLYGONAL CURVE SIMPLIFICATION
"... Curvature, curve simplification, DouglasPeucker, level of detail, polygonal curve, polyline, simplification algorithm, SimpliPoly. A curvaturebased algorithm to simplify a polygonal curve is described, together with its implementation. The socalled SimpliPoly algorithm uses Bézier curves to appro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Curvature, curve simplification, DouglasPeucker, level of detail, polygonal curve, polyline, simplification algorithm, SimpliPoly. A curvaturebased algorithm to simplify a polygonal curve is described, together with its implementation. The socalled SimpliPoly algorithm uses Bézier curves
Matching polygonal curves with respect to the Fréchet distance
, 2001
"... We provide the first algorithm for matching two polygonal curves P and Q under translations with respect to the Fréchet distance. If P and Q consist of m and n segments, respectively, the algorithm has runtime O (mn) 3 (m+n) 2 log(m+n). We also present an algorithm giving an approximate solution as ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
We provide the first algorithm for matching two polygonal curves P and Q under translations with respect to the Fréchet distance. If P and Q consist of m and n segments, respectively, the algorithm has runtime O (mn) 3 (m+n) 2 log(m+n). We also present an algorithm giving an approximate solution
Results 1  10
of
61,902