A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron

Discrete and Computational Geometry - United States
doi 10.1007/s00454-012-9415-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On Topological Changes in the Delaunay Triangulation of Moving Points

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

An Algorithm of Semi-Delaunay Triangulation of Points Cloud Scattered on a Surface

Computer Science
Computer GraphicsPattern RecognitionComputer NetworksSimulationCommunicationsComputer VisionComputer-Aided DesignComputer ScienceMathematicsComputational TheoryModelingArtificial Intelligence
2014English

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2010English

Complexity of the Delaunay Triangulation of Points on Surfaces the Smooth Case

2003English

A Data Forwarding Scheme Based on Delaunay Triangulation for Cyber-Physical Systems

Mathematical Problems in Engineering
MathematicsEngineering
2013English

A Delaunay Triangulation Approach for Segmenting Clumps of Nuclei

2009English

Output Sensitive Construction of the Delaunay Triangulation of Points Lying in Two Planes

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1996English

Curved Optimal Delaunay Triangulation

ACM Transactions on Graphics
Computer GraphicsComputer-Aided Design
2018English

Improving Delaunay Triangulation for Application-Level Multicast

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy