MPI-I-2003-4-003. April 2003, 16 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
2824 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |