Sciweavers

1245 search results - page 4 / 249
» Triangulation for Points on Lines
Sort
View
COMGEO
2006
ACM
13 years 11 months ago
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
Christopher Dyken, Michael S. Floater
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
14 years 6 days ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable
CGI
1998
IEEE
14 years 3 months ago
A Data Dependent Triangulation for Vector Fields
This article deals with dependencies of a piecewise linear vector field and the triangulation of the domain. It shows that the topology of the field may depend on the triangulatio...
Gerik Scheuermann, Hans Hagen
ALGORITHMICA
2007
118views more  ALGORITHMICA 2007»
13 years 11 months ago
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vit...
GIS
2002
ACM
13 years 10 months ago
Characterisation and generalisation of cartographic lines using Delaunay triangulation
A method is presented for generalising cartographic lines using an approach based on determination of their structure. Constrained Delaunay triangulation is used to construct a ske...
P. M. van der Poorten, Christopher B. Jones