Computational geometry: an introduction
Computational geometry: an introduction
Sweeping of three-dimensional objects
Computer-Aided Design
Geometric representation of swept volumes with application to polyhedral objects
International Journal of Robotics Research
Comprehensible rendering of 3-D shapes
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Real-time nonphotorealistic rendering
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Interactive technical illustration
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Image precision silhouette edges
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Computer-generated pen-and-ink illustration of trees
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Efficient perspective-accurate silhouette computation and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Output Sensitive Extraction of Silhouettes from Polygonal Geometry
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
A Developer's Guide to Silhouette Algorithms for Polygonal Models
IEEE Computer Graphics and Applications
Optimal Accurate Minkowski Sum Approximation of Polyhedral Models
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
| Hi-index | 0.00 |
The efficient extraction of model silhouettes is essential in many applications, such as non-photorealistic rendering, backface culling, shadow computation, and computing swept volumes. For dynamically moving viewpoints, efficient silhouette extraction is more important for system performance. Accordingly, this paper presents an incremental update algorithm for computing a perspective silhouette sequence for a polyhedral model. The viewpoint is assumed to move along a given trajectory q(t), where t is the time parameter. As the preprocessing step, the time-intervals during which each model edge is contained in the silhouette, defined as silhouette time-intervals, are computed using two major computations: (i) intersecting q(t) with two planes and (ii) a number of dot products. If q(t) is a curve of degree n, there are at most n+1 silhouette time-intervals for an individual edge. The silhouette time-intervals are then used to determine the edges that should be added or deleted from the previous silhouette for each discrete viewpoint, thereby providing an optimal way to compute a sequence of silhouettes. A search-based algorithm is also presented that extracts the silhouette edges for each time point t"j by searching the silhouette time-intervals containing t"j. The performance of the proposed algorithms is analyzed and experimental results are compared with those for the anchored cone algorithm suggested by Sander et al. [In: Akeley K, editor. Siggraph 2000, Computer Graphics Proceedings. Annual Conference Series. New York/Reading, MA/New York: ACM Press/ACM SIGGRAPH/Addison-Wesley/Longman; 2000. p. 327-34.]