In this paper, we answer this problem by disproving it in the general case and even when the skeleton is restricted to a tree or, in particular, a star.
Abstract. It is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy.
Feb 14, 2000 · It is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, ...
It is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, minimum- weight ...
Mar 1, 2000 · It is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, ...
It is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, minimum-weight ...
The drawability problem for minimum weight triangulations · Triangulations without Minimum-Weight Drawing · Drawing outerplanar minimum weight triangulations.
People also ask
What is minimum weight triangulation problem?
What is a minimal triangulation of surfaces?
Classes of triangulations that do not have a minimum weight drawing are presented in Section 3. In the same section we compare minimum weight drawable and ...
Furthermore, we present non-trivial classes of triangulations that are minimum weight drawable, along with corresponding linear time (real RAM) algorithms that ...