Results 1  10
of
1,613
An Approach to Polygonal Approximation of Digital
"... Abstract: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the polygonal approximation problem, which is represented as a binary vector. The offset error of centroid between the o ..."
Abstract
 Add to MetaCart
Abstract: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the polygonal approximation problem, which is represented as a binary vector. The offset error of centroid between
On the Implementation of Polygonal Approximation Algorithms
, 2003
"... Introduction The polygonal approximation, as a simplification procedure of an input curve representation, consists the main subject of many studies, but most of them are exclusively focused only on the theoretical matters and the practical aspects about their implementation are usually ignored. From ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Introduction The polygonal approximation, as a simplification procedure of an input curve representation, consists the main subject of many studies, but most of them are exclusively focused only on the theoretical matters and the practical aspects about their implementation are usually ignored
Polygonal Approximation of Point Sets
"... Abstract. Our domain of interest is polygonal (and polyhedral) approximation of point sets. Neither the order of data points nor the number of needed line segments (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given as edge ..."
Abstract
 Add to MetaCart
Abstract. Our domain of interest is polygonal (and polyhedral) approximation of point sets. Neither the order of data points nor the number of needed line segments (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given
A Polygonal Approximation to Direct Scalar Volume Rendering
 Computer Graphics
, 1990
"... One method of directly rendering a threedimensional volume of scalar data is to project each cell in a volume onto the screen. Rasterizing a volume cell is more complex than rasterizing a polygon. A method is presented that approximates tetrahedral volume cells with hardware renderable transparent ..."
Abstract

Cited by 250 (3 self)
 Add to MetaCart
One method of directly rendering a threedimensional volume of scalar data is to project each cell in a volume onto the screen. Rasterizing a volume cell is more complex than rasterizing a polygon. A method is presented that approximates tetrahedral volume cells with hardware renderable transparent
Techniques for Assessing Polygonal Approximations of Curves
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... Given the enormous number of available methods for finding polygonal approximations to curves techniques are required to assess different algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing an al ..."
Abstract

Cited by 76 (4 self)
 Add to MetaCart
Given the enormous number of available methods for finding polygonal approximations to curves techniques are required to assess different algorithms. Some of the standard approaches are shown to be unsuitable if the approximations contain varying numbers of lines. Instead, we suggest assessing
Polygonal approximation of flows
 In preparation
, 2004
"... The analysis of the qualitative behavior of flows generated by ordinary differential equations often requires quantitative information beyond numerical simulation which can be difficult to obtain analytically. In this paper we present a computational scheme designed to capture qualitative informatio ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
information using ideas from the Conley index theory. Specifically we design an combinatorial multivalued approximation from a simplicial decomposition of the phase space, which can be used to extract isolating blocks for isolated invariant sets. These isolating blocks can be computed rigorously to provide
Polygonal approximation of closed contours
"... Optimal approximation of closed curves differs from the case of open curve in the sense that the location of the starting point must also be determined. Straightforward exhaustive search would take N times more time than the corresponding algorithm for open curve. We propose to approximate a cycli ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Optimal approximation of closed curves differs from the case of open curve in the sense that the location of the starting point must also be determined. Straightforward exhaustive search would take N times more time than the corresponding algorithm for open curve. We propose to approximate a
Arclength via Polygonal Approximation
 SUPPLEMENTARY NOTES FOR MM08 GEOMETRY I
"... Pressley gives an informal argument in his book [2] to justify the definition of arc length of a smooth curve. The purpose of these notes is to make that justi cation more rigorous, by showing that the arc length may be obtained as the limit of the lengths of polygonal curves. An alternative present ..."
Abstract
 Add to MetaCart
Pressley gives an informal argument in his book [2] to justify the definition of arc length of a smooth curve. The purpose of these notes is to make that justi cation more rigorous, by showing that the arc length may be obtained as the limit of the lengths of polygonal curves. An alternative
Adaptive Polygonal Approximation of Parametric Curves
"... We present methods for constructing polygonal approximation of parametric curves based on adaptively sampling the parameter domain with respect to curvature. An important feature of these methods is the use of random probing for handling aliasing. We also discuss numerical applications of this me ..."
Abstract
 Add to MetaCart
We present methods for constructing polygonal approximation of parametric curves based on adaptively sampling the parameter domain with respect to curvature. An important feature of these methods is the use of random probing for handling aliasing. We also discuss numerical applications
Assessing the Behaviour of Polygonal Approximation Algorithms
 Pattern Recognition
, 1998
"... In a recent paper we described a method for assessing the accuracy of polygonal approximation algorithms [16]. Here we develop several measures to assess the stability of such approximation algorithms under variations in their scale parameters. A monotonicity index is introduced that can be appli ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In a recent paper we described a method for assessing the accuracy of polygonal approximation algorithms [16]. Here we develop several measures to assess the stability of such approximation algorithms under variations in their scale parameters. A monotonicity index is introduced that can
Results 1  10
of
1,613