Results 181 to 190 of about 7,960 (210)

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   +1 more source

On the Stretch Factor of the Constrained Delaunay Triangulation

2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are in P, let CDT(P, S) be the constrained Delaunay triangulation of P with respect to S. Given any two visible points p, q \in P, we show that there exists a path from p to q in CDT(P, S), denoted SPCDT(p, q), such that every edge in the path has length at
openaire   +1 more source

An optimal mesh computer algorithm for constrained Delaunay triangulation

Proceedings of 8th International Parallel Processing Symposium, 2002
We present an optimal parallel algorithm that runs in O(/spl radic/n) time on a /spl radic/n/spl timesspl radic/n mesh to compute the constrained Delaunay triangulation of a planar straight line graph G whose vertices lie in an n-element set S. Implications of our result also include an efficient PRAM algorithm for the same problem, a new optimal mesh ...
openaire   +1 more source

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   +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

Capacity-Constrained Delaunay Triangulation for point distributions

Computers & Graphics, 2011
Yin Xu, Ligang Liu, Craig Gotsman, Steven J. Gortler   +3 more
openaire   +1 more source

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   +1 more source

An adaptive spatial clustering algorithm based on delaunay triangulation

Computers, Environment and Urban Systems, 2011
Min Deng, Qiliang Liu, Tao Cheng
exaly  

Efficient construction and simplification of Delaunay meshes

ACM Transactions on Graphics, 2015
Ying He
exaly