research

Computing a subgraph of the minimum weight triangulation

Authors
Publication date
1994
Publisher
Published by Elsevier B.V.
Doi

    Abstract

    AbstractGiven a set S of n points in the plane, it is shown that the 2-skeleton of S is a subgraph of the minimum weight triangulation of S. The β-skeletons are polynomially computable Euclidean graphs introduced by Kirkpatrick and Radke [8]. The 2-skeleton of S is the β-skeleton of S for β = 2

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    Last time updated on 06/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.