Results 181 to 190 of about 681,623 (204)

Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain

1997
A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay triangulation of a polygonal domain. The algorithm simplifies the complicated merging step inherent to divide-and-conquer algorithms for the computation of triangulations.
openaire   +2 more sources

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

Image Completion Using Constrained Delaunay Triangulation

2011 Fourth International Conference on Intelligent Computation Technology and Automation, 2011
In this paper, we proposed a novel algorithm of automatic image structure completion. Different from traditional image completion algorithms directly copying patches from the unknown region to the damaged part, our completion approach first reconstructs the geometry structures in the damaged region with edges inferred by Constrained Delaunay ...
Han Zhou, Rong Zhang, Baoyun Wang, Dong Yin   +3 more
openaire   +1 more source

Updating and constructing constrained delaunay and constrained regular triangulations by flips

Proceedings of the nineteenth conference on Computational geometry - SCG '03, 2003
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d - 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CDTs, also known as constrained regular triangulations. The facet insertion algorithm is likely to outperform other known algorithms on most inputs. The facet deletion algorithm is
openaire   +2 more sources

Bridge extraction based on on constrained Delaunay triangulation for panchromatic image

2011 IEEE International Geoscience and Remote Sensing Symposium, 2011
Nowadays, with the rapid increase of spatial resolution in remote sensing, accurate and efficient identification of man-made targets from large-scale high resolution panchromatic images plays a more and more important role in real applications. This paper presents an efficient bridge extraction method based on CDT.
Feng Gao 0005, Lei Hu 0009, Zhaofeng He 0001   +2 more
openaire   +2 more sources

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).
Sung-Soo Kim, Jong Hyun Park
openaire   +2 more sources

Realtime Obstacle Detection and Tracking Based on Constrained Delaunay Triangulation

2006 IEEE Intelligent Transportation Systems Conference, 2006
We introduce a realtime vehicle detection and tracking algorithm for in-vehicle video images. Although various vehicle detection approaches have been proposed, it is difficult to find a fast and reliable algorithm for realtime applications, such as for vehicle collision warning. We introduce a realtime appearance-based vehicle detection approach.
openaire   +2 more sources

A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations

Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98, 1998
Let X be a complex of vertices and piecewise linear constraining facets embedded in Ed. Say that a simplex is strongly Delaunay if its vertices are in X and there exists a sphere that passes through its vertices but passes through and encloses no other vertex.
openaire   +1 more source

Constrained Edges and Delaunay Triangulation

2020
Simena Dinas, Héctor J. Martínez
openaire   +1 more source

Constrained Delaunay Triangulation

2006
Øyvind Hjelle, Morten Dæhlen
openaire   +1 more source