Talks and Poster Presentations (without Proceedings-Entry):
S. Ohrhallinger, S. Mudur:
"An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganised 2D Points";
Talk: Eurographics Symposium on Rendering 2013,
Zaragoza, Spain (invited);
We present an efficient algorithm for determining an aesthetically pleasing shape boundary connecting all the points in a given unorganised set of 2D points, with no other information than point coordinates. By posing shape construction as a minimisation problem which follows the Gestalt laws, our desired shape Bmin is non-intersecting, interpolates all points and minimises a criterion related to these laws. The basis for our algorithm is an initial graph, an extension of the Euclidean minimum spanning tree but with no leaf nodes, called as the minimum boundary complex BCmin. BCmin and Bmin can be expressed similarly by parametrising a topological constraint. A close approximation of BCmin, termed BC0 can be computed fast using a greedy algorithm. BC0 is then transformed into a closed interpolating boundary Bout in two steps to satisfy Bmin´s topological and minimization requirements. Computing Bmin exactly is an NP-hard problem, whereas Bout is computed in linearithmic time. We present many examples showing considerable improvement over previous techniques, especially for shapes with sharp corners. Source code is available online.
curve reconstruction, boundary representation, sampling condition, computational geometry
Created from the Publication Database of the Vienna University of Technology.