Sciweavers

84
Voted
SGP
2004
14 years 11 months ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
IMR
2004
Springer
15 years 2 months ago
Mark-It: A Marking User Interface for Cutting Decomposition Time
We present Mark-It, a marking user interface that reduced the time to decompose a set of CAD models exhibiting a range of decomposition problems by as much as fifty percent. Inst...
Nicholas C. Yang, Andrew S. Forsberg, Jason F. She...