ausblenden:
Schlagwörter:
-
Zusammenfassung:
Angle Based Flattening is a robust parameterization method that finds a
quasi-conformal mapping by solving a non-linear optimization problem. We
take advantage of a characterization of convex planar drawings of
triconnected graphs to introduce new boundary constraints. This prevents
boundary intersections and avoids post-processing of the parameterized
mesh. We present a simple transformation to e ectively relax the
constrained minimization problem, which improves the convergence of the
optimization method. As a natural extension, we discuss the construction
of Delaunay flat meshes. This may further enhance the quality of the
resulting parameterization.