### Abstract

Many surfaces in geometric and solid modeling, including offsets and blends, are naturally defined from given surfaces subject to geometric constraints. Surfaces that are geometrically constrained can be uniformly defined as the projection of two-dimensional manifolds (2-surfaces) in n-dimensional space, where n>3. This definition can be used for given surfaces that are implicit or parametric. This paper presents a robust, adaptive polygonization algorithm for evaluating and visualizing geometrically constrained surfaces. Let ℱ be the constrained surface, a 2-surface in n-space, and let π(ℱ) be its projection into the subspace spanned by the first three coordinates. Our polygonization algorithm computes π(ℱ). The method works directly with the n-space representation, but performs all major computations in 3-space. Techniques for triangulation, polygon decimation, and local refinement are also presented.

Original language | English |
---|---|

Pages (from-to) | 455-470 |

Number of pages | 16 |

Journal | Visual Computer |

Volume | 14 |

Issue number | 10 |

DOIs | |

State | Published - 1 Jan 1998 |

### Keywords

- Constrained surfaces
- Exact representation
- Polygonization
- Rendering

## Fingerprint Dive into the research topics of 'Adaptive polygonization of geometrically constrained surfaces'. Together they form a unique fingerprint.

## Cite this

*Visual Computer*,

*14*(10), 455-470. https://doi.org/10.1007/s003710050155