ScholarLens Back to search
2011•Computer Engineering and Applications JournalRequires access

Decrement construction algorithm for Voronoi tessellation

Liu Gang

Open publisher page 0 citations

Abstract

After deleting one node from the given Voronoi tessellation,Decrement Construction Voronoi Tessellation(DCVT) is to locally reconstruct the Voronoi tessellation of the remaining nodes.The changes of other Voronoi regions after deleting one node are analyzed.The main job of DCVT is simplified to construct a bounded Voronoi tessellation.The algorithm of DCVT is proposed based on a simple strategy of building the bounded Voronoi tessellation.Theoretic analysis and experiment results show that the average time complexity of the proposed algorithm is O(1).

About this research paper

What this paper is about

After deleting one node from the given Voronoi tessellation,Decrement Construction Voronoi Tessellation(DCVT) is to locally reconstruct the Voronoi tessellation of the remaining nodes.The changes of other Voronoi regions after deleting one node are analyzed.The main job of DCVT is simplified to construct a bounded Voronoi tessellation.The algorithm of DCVT is proposed based on a simple strategy of building the bounded Voronoi tessellation.Theoretic analysis and experiment results show that the average time complexity of the proposed algorithm is O(1).

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

After deleting one node from the given Voronoi tessellation,Decrement Construction Voronoi Tessellation(DCVT) is to locally reconstruct the Voronoi tessellation of the remaining nodes.The changes of other Voronoi regions after deleting one node are analyzed.The main job of DCVT is simplified to construct a bounded Voronoi tessellation.The algorithm of DCVT is proposed based on a simple strategy of building the bounded Voronoi tessellation.Theoretic analysis and experiment results show that the average time complexity of the proposed algorithm is O(1).

Key concepts: Centroidal Voronoi tessellation, Voronoi diagram, Tessellation (computer graphics), Node (physics), Weighted Voronoi diagram, Bounded function, Mathematics, Construct (python library)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Decrement construction algorithm for Voronoi tessellation — Research Paper | ScholarLens