ScholarLens Back to search
1999•SIAM Journal on ComputingRequires access

Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time

ChinFrancis, WangCao An

Open publisher page 0 citations

Abstract

In this paper, we present an $\Theta (n)$ time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in t...

About this research paper

What this paper is about

In this paper, we present an $\Theta (n)$ time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in t...

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we present an $\Theta (n)$ time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in t...

Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Voronoi diagram, Pitteway triangulation, Constrained Delaunay triangulation, Combinatorics, Simple (philosophy), Centroidal Voronoi tessellation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time — Research Paper | ScholarLens