Hidden curve removal for free form surfaces
نویسندگان
چکیده
منابع مشابه
Global Visibility and Hidden Surface Removal Algorithms for Free Form Surfaces
Computing the visible portions of free-form surfaces from a given viewpoint is of great interest in many applications. It is closely related to the hidden surface removal problem in computer graphics and machining applications in manufacturing. Most of the earlier work has focused on discrete methods based on polygonization or ray-tracing, hidden curve removals and local visibility computations...
متن کاملHidden Surface Removal Algorithms for Curved Surfaces
Computing the visible portions of curved surfaces from a given viewpoint is of great interest in many applications It is closely related to the hidden surface removal problem in computer graphics and machining applications in manufacturing Most of the earlier work has focused on discrete methods based on polygonization or ray tracing and hidden curve removal In this paper we present an algorith...
متن کاملMatching free-form surfaces
In this work, the matching problem between two free-form parametric surfaces, S 0 (u, v) and S 1 (u, v), has been considered in the context of a "rst stage of the metamorphosis process, which is de"ned as gradual and continuous transformation of one key shape into another. A method is presented to approximate the two reparametrization functions, r(u, v) and t(u, v), via a discrete sampled set o...
متن کاملMachining Free-Form Surfaces
This paper presents an analytical method for planning an efficient tool-path in machining free-form surfaces on 3-axis milling machines. This new approach uses a nonconstant offset of the previous tool-path, which guarantees the cutter moving in an unmachined area of the part surface and without redundant machining. The method comprises three steps: (1) the calculation of the tool-path interval...
متن کاملGauss map computation for free-form surfaces
The Gauss map of a smooth doubly{curved surface characterizes the range of variation of the surface normal as an area on the unit sphere. An algorithm to approximate the Gauss map boundary to any desired accuracy is presented, in the context of a tensor{product polynomial surface patch, r(u;v) for (u; v) 2 0; 1 ] 0; 1 ]. Boundary segments of the Gauss map correspond to variations of the normal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGGRAPH Computer Graphics
سال: 1990
ISSN: 0097-8930
DOI: 10.1145/97880.97890