Work

Increasing-Chord Graphs On Point Sets

Year: 2014

Type: preprint

Abstract: We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P. Further, we prove that, for every convex point set P with n points, there exists an increasing-chord graph with O(n log n) edges (and with no Steiner points) spanning P.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1408.2592

Authors: Dehkordi, Hooman Reisi, Frati, Fabrizio, Gudmundsson, Joachim

Institutions: Monash University, The University of Sydney

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2949237486

Cites:

Cited by: 3

Related to: 20