### Abstract

Given a set S of n ≥ 3 points in the plane (not all on a line) it is well known that it is always possible to polygonize S, i.e., construct a simple polygon P such that the vertices of P are precisely the given points in S. For example, the shortest circuit through S is a simple polygon. In 1994, Grünbaum showed that an analogous theorem holds in R^{3}. More precisely, if S is a set of n ≥ 4 points in R^{3} (not all of which are coplanar) then it is always possible to polyhedronize S, i.e., construct a simple (sphere-like) polyhedron P such that the vertices of P are precisely the given points in S. Grünbaum's constructive proof may yield Schönhardt polyhedra that cannot be triangulated. In this paper several alternative algorithms are proposed for constructing such polyhedra induced by a set of points, which may always be triangulated, and which enjoy several other useful properties as well. Such properties include polyhedra that are star-shaped, have Hamiltonian skeletons, and admit efficient point-location queries. We show that polyhedronizations with a variety of such useful properties can be computed efficiently in O (n log n) time. Furthermore, we show that a tetrahedralized, xy-monotonic, polyhedronization of S may be computed in time O (n^{1 + ε{lunate}}), for any ε{lunate} > 0.

Original language | English (US) |
---|---|

Pages (from-to) | 42-54 |

Number of pages | 13 |

Journal | Discrete Applied Mathematics |

Volume | 156 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 2008 |

### Fingerprint

### Keywords

- Computational geometry
- Polyhedra
- Triangulation

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

### Cite this

*Discrete Applied Mathematics*,

*156*(1), 42-54. https://doi.org/10.1016/j.dam.2007.08.033