Dynamic T‐search for accelerating searching speeds in Delaunay triangulation

DOI10.1108/02644400310467216zbMATH Open1045.65019OpenAlexW2043355546MaRDI QIDQ4467355FDOQ4467355

Authors: Sugjoon Yoon 

Publication date: 9 June 2004

Published in: Engineering Computations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/02644400310467216

Recommendations

• A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
• Fast Delaunay triangulation in three dimensions
• Terrain modelling by using Delaunay triangulation
• Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
• Fast range searching with Delaunay triangulations

zbMATH Keywords

algorithmsnumerical examplesDelaunay triangulationsurface modelingoff-road vehicle dynamicstriangle-search

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Dynamic T‐search for accelerating searching speeds in Delaunay triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467355)