Computational geometry: an introduction
Computational geometry: an introduction
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Polynomial-size nonobtuse triangulation of polygons
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Manhattonian proximity in a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Fast greedy triangulation algorithms
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A data model for representing geological surfaces
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Towards space: time light field rendering
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Photo tourism: exploring photo collections in 3D
ACM SIGGRAPH 2006 Papers
Algorithm 872: Parallel 2D constrained Delaunay mesh generation
ACM Transactions on Mathematical Software (TOMS)
Modeling the World from Internet Photo Collections
International Journal of Computer Vision
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Robot Navigation in Multi-terrain Outdoor Environments
International Journal of Robotics Research
Optimal triangulation with Steiner points
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Multi-robot area coverage with limited visibility
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
TriangleFlow: optical flow with triangulation-based higher-order likelihoods
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Scene reconstruction and visualization from internet photo collections
Scene reconstruction and visualization from internet photo collections
Delaunay-Based polygon morphing across a change in topology
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
3D mesh construction from depth images with occlusion
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms
Computing best coverage path in the presence of obstacles in a sensor field
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Capture bounds for visibility-based pursuit evasion
Proceedings of the twenty-ninth annual symposium on Computational geometry
Multi-robot repeated area coverage
Autonomous Robots
Linear fitted-Q iteration with multiple reward functions
The Journal of Machine Learning Research
Geometry curves: A compact representation for 3D shapes
Graphical Models
| Hi-index | 0.00 |
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the Delaunay triangulation. We show that the CDT can be built in optimal &Ogr;(n log n) time using a divide-and-conquer technique. This matches the time required to build an arbitrary (unconstrained) Delaunay triangulation and the time required to build an arbitrary constrained (nonDelaunay) triangulation. CDTs, because of their relationship with Delaunay triangulations, have a number of properties that should make them useful for the finite-element method. Applications also include motion planning in the presence of polygonal obstacles in the plane and constrained Euclidean minimum spanning trees, spanning trees subject to the restriction that some edges are prespecified.