## Abstract

In 1994 Grunbaum [2] showed, given a point set S in R3, that it is always possible to construct a polyhedron whose vertices are exactly S. Such a polyhedron is called a polyhedronization of S. Agarwal et al. [1] extended this work in 2008 by showing that a polyhedronization always exists that is decomposable into a union of tetrahedra (tetrahedralizable). In the same work they introduced the notion of a serpentine polyhedronization for which the dual of its tetrahedralization is a chain. In this work we present an algorithm for constructing a serpentine polyhedronization that has vertices with bounded degree of 7, answering an open question by Agarwal et al. [1].

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

Pages | 99-102 |

Number of pages | 4 |

State | Published - 2010 |

Event | 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 - Winnipeg, MB, Canada Duration: Aug 9 2010 → Aug 11 2010 |

### Other

Other | 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010 |
---|---|

Country/Territory | Canada |

City | Winnipeg, MB |

Period | 8/9/10 → 8/11/10 |

## ASJC Scopus subject areas

- Computational Mathematics
- Geometry and Topology