Results 171 to 180 of about 7,960 (210)

Path planning based on Constrained Delaunay Triangulation

2008 7th World Congress on Intelligent Control and Automation, 2008
This paper proposes a path planning algorithm for determining an optimal path with respect to the costs of a dual graph on the Constrained Delaunay Triangulation (CDT) of an environment. The advantages of using triangles for environment expression are: less data storage required, available mature triangulation methods and consistent with a potential ...
null Hongyang Yan, null Huifang Wang, null Yangzhou Chen, null Guiping Dai   +3 more
openaire   +1 more source

An on-line algorithm for constrained Delaunay triangulation

CVGIP: Graphical Models and Image Processing, 1992
Abstract A constrained Delaunay triangulation is a Delaunay triangulation of a set of points and straight-line segments. A constrained Delaunay triangulation is a basic tool for describing a topographic surface in several applications. In this paper, the definition of constrained Delaunay triangulation is introduced and its basic properties are ...
DE FLORIANI, LEILA, PUPPO, ENRICO
openaire   +2 more sources

A fast algorithm for generating constrained delaunay triangulations

Computers & Structures, 1993
A fast algorithm for generating constrained two-dimensional Delaunay triangulations by modifying the existing unconstrained Delaunay triangulations is described. The modification is that certain edges are forced to be present. Such Delaunay schemes automatically avoid the formation of long thin triangles and thus give high quality grids. The main steps
openaire   +2 more sources

The Employment of Regular Triangulation for Constrained Delaunay Triangulation

2004
We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constrained Delaunay triangulation based on the use of regular triangulation. As far as we know, such a connection has not been presented yet in the literature and there is no algorithm based on
Pavel Maur, Ivana Kolingerová
openaire   +1 more source

Space-efficient terrain rendering using constrained Delaunay triangulation

IEEE International Geoscience and Remote Sensing Symposium, 2003
Proposes a new terrain visualization technique associated with the conversion process from a contour-based data model to a triangulated irregular network (TIN) model. The main research related to processing these contour lines had been focused on interpolation methods to create the digital terrain model (DTM).
null Sung-Soo Kim, null Jong-Hyun Park
openaire   +1 more source

Duality of constrained Voronoi diagrams and Delaunay triangulations

Algorithmica, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joe, Barry, Wang, Cao An
openaire   +2 more sources

Triangle refinement in a constrained Delaunay triangulation skeleton

Pattern Recognition, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Morrison, Paul (S25118), Zou, Ju Jia (R10477)   +1 more
openaire   +2 more sources

A Fast Algorithm for Constructing Constrained Delaunay Triangulation

2009 IEEE-RIVF International Conference on Computing and Communication Technologies, 2009
This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are considered any kind of polygonal lines. The bottleneck of incremental Delaunay triangulation algorithm is the search for a triangle containing current integrating point.
Nguyen Minh Nam, Nguyen Vinh Nam, Hoang Van Kiem   +2 more
openaire   +1 more source

A new skeletonization algorithm based on constrained Delaunay triangulation

ISSPA '99. Proceedings of the Fifth International Symposium on Signal Processing and its Applications (IEEE Cat. No.99EX359), 2003
A new skeletonization algorithm based on the constrained Delaunay triangulation (CDT) is proposed in this paper. The CDT partitions a shape into a set of nonoverlapping triangles which represent the shape's local symmetry properties and interconnecting relationships between branches.
null Ju Jia Zou, null Hung-Hsin Chang, null Hong Yan   +2 more
openaire   +1 more source

A Constrained Delaunay Triangulation Algorithm Based on Incremental Points

Applied Mechanics and Materials, 2011
The foundation ofdelaunay triangulationandconstrained delaunay triangulationis the basis of three dimensional geographical information system which is one of hot issues of the contemporary era; moreover it is widely applied in finite element methods, terrain modeling and object reconstruction, euclidean minimum spanning tree and other applications.
Bai Chao Wu, Ai Ping Tang, Lian Fa Wang
openaire   +1 more source