• Publications
  • Influence
Sweep‐line algorithm for constrained Delaunay triangulation
This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining edges. Expand
  • 42
  • 5
Constrained Delaunay Triangulation using Plane Subdivision
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. Expand
  • 17
  • PDF
Dealing with redundancy and inconsistency in constructive geometric constraint solving
General constructive geometric constraint solvers are pre-processed by a degree-of-freedom analysis, which enables efficient graph decomposition and recombination. Expand
  • 11
Surface reconstruction algorithms in cultural heritage digital representation
The goal of our work is to present the application of the modern technologies and computer graphics algorithms in the field of cultural heritage reconstruction and its protection and overview of various applications of reconstructed models. Expand
  • 6
A general algorithm for triangular meshes simplification
This article introduces the algorithm for simplification of 2D and 3D triangular meshes. The algorithm evaluates and removes vertices. A hash table is used to speed up the process of selecting theExpand
  • 2
  • PDF
Osnovni cilj doktorske naloge je razviti lasten postopek omejene Delaunayeve triangulacije z metodo prebiranja, ki bo vsaj enako ucinkovit kot do sedaj razviti postopki in pokazati, da je sExpand
  • 1
A prototype of a sweeping surface reconstruction algorithm
In this article we present a new approach for surface reconstruction using a sweeping paradigm. The algorithm uses advancing fronts to localize triangle formation and fast 2D searching to locateExpand