# A Note on α-Drawable k-Trees

4 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
5 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We study the problem of realizing a given graph as an $\alpha$-complex of a set of points in the plane. We study the realizability problem for trees and $2$-trees. In the case of $2$-trees, we confine our attention to the realizability of graphs as the $\alpha$-complex minus faces of dimension two; in other words, realizability of the graph in terms of the $1$-skeleton of the $\alpha$-complex of the point set. We obtain both positive (realizability) and negative (non-realizability) results.
Document type :
Conference papers

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00324589
Contributor : Christophe Paul <>
Submitted on : Thursday, September 25, 2008 - 2:43:27 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

### Identifiers

• HAL Id : lirmm-00324589, version 1

### Citation

David Bremner, Jonathan Lenchner, Giuseppe Liotta, Christophe Paul, Marc Pouget, et al.. A Note on α-Drawable k-Trees. CCCG'08: Canadian Conference on Computational Geometry, Canada. pp.23-27. ⟨lirmm-00324589⟩

Record views