- Full text PDF available (2)
- This year (0)
- Last 5 years (0)
- Last 10 years (4)
Journals and Conferences
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm… (More)
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 locate closest fronts for point insertion, resulting in low execution times.
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. Here we describe a methodology for digital 3D acquisition of the ldquoStecakrdquo (Stecak - plural Stecci - specific Bosnian Middle Ages tombstones), with purpose of its study and… (More)