Advanced search
Publication Cover
International Journal of Geographical Information Science Volume 17, 2003 - Issue 2
Submit an article Journal homepage
189
Views
24
CrossRef citations to date
0
Altmetric
Original Articles

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

Borut Žalik University of Maribor, Faculty of Electrical Engineering & Computer Sciences, Department of Computer Science, Maribor, Slovenia; e-mail: [email protected]
&
Ivana Kolingerová University of West Bohemia, Faculty of Applied Sciences, Department of Computer Science and Engineering, Plzen, Czech Republic
Pages 119-138 | Published online: 03 Dec 2010

Citations (24)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Amirtham Rajagopal, Markus Kraus & Paul Steinmann. (2018) Hyperelastic analysis based on a polygonal finite element method. Mechanics of Advanced Materials and Structures 25:11, pages 930-942.
Read now
Jiaxiang Lin, Chongcheng Chen & Jianwei Wu. (2013) CD-graph: planar graph representation for spatial adjacency and neighbourhood relation with constraints. International Journal of Geographical Information Science 27:10, pages 1902-1923.
Read now

Articles from other publishers (22)

Chuchu Chen, Patrick Geneva, Yuxiang Peng, Woosik Lee & Guoquan Huang. (2023) Monocular Visual-Inertial Odometry with Planar Regularities. Monocular Visual-Inertial Odometry with Planar Regularities.
Jiaxiang Lin, Riqing Chen, Liping Wu, Zhaogang Shu & Changcai Yang. (2017) Adaptive parallel Delaunay triangulation construction with dynamic pruned binary tree model in Cloud. Concurrency and Computation: Practice and Experience 29:24, pages e4157.
Crossref
Rui Qu, Shu-Shen Liu, Qiao-Feng Zheng & Tong Li. (2017) Using Delaunay triangulation and Voronoi tessellation to predict the toxicities of binary mixtures containing hormetic compound. Scientific Reports 7:1.
Crossref
Samuel Audet, Cecilia Albertsson, Masana Murase & Akihiro Asahara. (2013) Robust and efficient polygon overlay on parallel stream processors. Robust and efficient polygon overlay on parallel stream processors.
Markus Kraus, Amirtham Rajagopal & Paul Steinmann. (2013) Investigations on the polygonal finite element method: Constrained adaptive Delaunay tessellation and conformal interpolants. Computers & Structures 120, pages 33-46.
Crossref
Roman Soukal, Martina Málková & Ivana Kolingerová. (2012) Walking algorithms for point location in TIN models. Computational Geosciences 16:4, pages 853-869.
Crossref
Ahmad Biniaz & Gholamhossein Dastghaibyfard. (2012) A faster circle-sweep Delaunay triangulation algorithm. Advances in Engineering Software 43:1, pages 1-13.
Crossref
Roman Soukal, Martina Malková & Ivana Kolingerová. 2012. Advances in Visual Computing. Advances in Visual Computing 736 745 .
Bai Chao Wu, Ai Ping Tang & Lian Fa Wang. (2011) A Constrained Delaunay Triangulation Algorithm Based on Incremental Points. Applied Mechanics and Materials 90-93, pages 3277-3282.
Crossref
Ivana Kolingerová, Jan Trčka & Borut Žalik. (2011) The stochastic walk algorithms for point location in pseudo-triangulations. Advances in Engineering Software 42:8, pages 577-585.
Crossref
Mohamed Naouai, Melki Narjess & Atef Hamouda. (2010) Line extraction algorithm based on image vectorization. Line extraction algorithm based on image vectorization.
Vu Thanh Nguyen. (2010) Building TIN (triangular irregular network) problem in Topology model. Building TIN (triangular irregular network) problem in Topology model.
Roman Soukal & Ivana Kolingerová. (2010) Star-shaped polyhedron point location with orthogonal walk algorithm. Procedia Computer Science 1:1, pages 219-228.
Crossref
Nguyen Minh Nam, Le Hoai Bac & Nguyen Vinh Nam. (2009) An Extreme Algorithm for Network-Topology Construction Based on Constrained Delaunay Triangulation. An Extreme Algorithm for Network-Topology Construction Based on Constrained Delaunay Triangulation.
Ivana Kolingerová, Matyáš Dolák & Václav Strych. (2009) Eliminating contour line artefacts by using constrained edges. Computers & Geosciences 35:10, pages 1975-1987.
Crossref
Nguyen Minh Nam, Nguyen Vinh Nam & Hoang Van Kiem. (2009) A Fast Algorithm for Constructing Constrained Delaunay Triangulation. A Fast Algorithm for Constructing Constrained Delaunay Triangulation.
Borut Žalik. (2005) An efficient sweep-line Delaunay triangulation algorithm. Computer-Aided Design 37:10, pages 1027-1038.
Crossref
Mirko Zadravec & Borut Žalik. (2005) An almost distribution-independent incremental Delaunay triangulation algorithm. The Visual Computer 21:6, pages 384-396.
Crossref
Josef Kohout, Ivana Kolingerová & Jiřı́ Žára. (2004) Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory. Computers & Graphics 28:5, pages 703-718.
Crossref
Ivana Kolingerová, Václav Strych & Václav Čada. 2004. Computational Science - ICCS 2004. Computational Science - ICCS 2004 123 130 .
Ivana Kolingerová. 2004. Computational Science and Its Applications – ICCSA 2004. Computational Science and Its Applications – ICCSA 2004 544 553 .
Ivana Kolingerová & Borut Žalik. (2002) Improvements to randomized incremental Delaunay insertion. Computers & Graphics 26:3, pages 477-490.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.