Sciweavers

56 search results - page 2 / 12
» A Polygonal Line Algorithm for Constructing Principal Curves
Sort
View
CAGD
1998
99views more  CAGD 1998»
13 years 7 months ago
A Laguerre geometric approach to rational offsets
Laguerre geometry provides a simple approach to the design of rational curves and surfaces with rational offsets. These so-called PH curves and PN surfaces can be constructed from...
Martin Peternell, Helmut Pottmann
COMGEO
2008
ACM
13 years 7 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
ADCM
2006
110views more  ADCM 2006»
13 years 7 months ago
Interpolation on lattices generated by cubic pencils
: Principal lattices are distributions of points in the plane obtained from a triangle by drawing equidistant parallel lines to the sides and taking the intersection points as node...
Jesús M. Carnicer, Mariano Gasca
CG
2006
Springer
13 years 7 months ago
Supercover model, digital straight line recognition and curve reconstruction on the irregular isothetic grids
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested i...
David Coeurjolly, Loutfi Zerarga
DGCI
2005
Springer
14 years 1 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette