An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm-Reference-Cited by-同舟云学术

An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm

Published:2003-03 Issue:2 Volume:17 Page:119-138
ISSN:1365-8816
Container-title:International Journal of Geographical Information Science
language:en
Short-container-title:International Journal of Geographical Information Science

Author:

Žalik Borut,Kolingerová Ivana

Publisher

Informa UK Limited

Subject

Library and Information Sciences,Geography, Planning and Development,Information Systems

Link

http://www.tandfonline.com/doi/pdf/10.1080/713811749

Reference35 articles.

1. Voronoi diagrams—a survey of a fundamental geometric data structure

2. Optimal Expected-Time Algorithms for Closest Point Problems

3. Internal Report C92/16;CIGNONI P.,1992

4. ČUK, R. Construction of Voronoi diagrams using Fortune's method: a look on an implementation. 3rd Central European Seminar on Computer Graphics CESCG. pp.27–36. Budmerice, Slovak Republic.

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Texture Atlas Compression Based on Repeated Content Removal;SIGGRAPH Asia 2023 Conference Papers;2023-12-10

2. Monocular Visual-Inertial Odometry with Planar Regularities;2023 IEEE International Conference on Robotics and Automation (ICRA);2023-05-29

3. Hyperelastic analysis based on a polygonal finite element method;Mechanics of Advanced Materials and Structures;2017-07-26

4. Adaptive parallel Delaunay triangulation construction with dynamic pruned binary tree model in Cloud;Concurrency and Computation: Practice and Experience;2017-05-29

5. Using Delaunay triangulation and Voronoi tessellation to predict the toxicities of binary mixtures containing hormetic compound;Scientific Reports;2017-03-13