Vertex classification for non-uniform geometry reduction

نویسنده

  • J. Fernando dos Santos Fradinho Duarte de Oliveira
چکیده

Complex models created from isosurface extraction or CAD and highly accurate 3D models produced from high-resolution scanners are useful, for example, for medical simulation, Vir­ tual Reality and entertainment. Often models in general require some sort of manual editing before they can be incorporated in a walkthrough, simulation, computer game or movie. The visualization challenges of a 3D editing tool may be regarded as similar to that of those of other applications that include an element of visualization such as Virtual Reality. However the rendering interaction requirements of each of these applications varies according to their purpose. For rendering photo-realistic images in movies computer farms can render uninter­ rupted for weeks, a 3D editing tool requires fast access to a model’s fine data. In Virtual Reality rendering acceleration techniques such as level of detail can temporarily render parts of a scene with alternative lower complexity versions in order to meet a frame rate tolerable for the user. These alternative versions can be dynamic increments of complexity or static models that were uniformly simplified across the model by minimizing some cost function. Scanners typically have a fixed sampling rate for the entire model being scanned, and therefore may generate large amounts of data in areas not of much interest or that contribute little to the application at hand. It is therefore desirable to simplify such models non-uniformly. Features such as very high curvature areas or borders can be detected automatically and simplified differently to other areas without any interaction or visualization. However a prob­ lem arises when one wishes to manually select features of interest in the original model to preserve and create stand alone, non-uniformly reduced versions of large models, for example for medical simulation. To inspect and view such models the memory requirements of LoD rep­ resentations can be prohibitive and prevent storage of a model in main memory. Furthermore, although asynchronous rendering of a base simplified model ensures a frame rate tolerable to the user whilst detail is paged, no guarantees can be made that what the user is selecting is at the original resolution of the model or of an appropriate LoD owing to disk lag or the complexity of a particular view selected by the user. This thesis presents an interactive method in the con­ text of a 3D editing application for feature selection from any model that fits in main memory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Plane Spanners of Degree 3

Let S be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane 3+4π 3 -spanner of S whose vertex degree is at most 3. Let Λ be the vertex set of a finite non-uniform rectangular lattice in the plane. We present an algorithm that constructs a plane 3 √ 2-spanner for Λ whose vertex degree is at most 3. For points that are in the plane and...

متن کامل

Non uniform (hyper/multi)coherence spaces

In (hyper)coherence semantics, proofs/terms are cliques in (hyper)graphs. Intuitively, vertices represent results of computations and the edge relation witnesses the ability of being assembled into a same piece of data or a same (strongly) stable function, at arrow types. In (hyper)coherence semantics, the argument of a (strongly) stable functional is always a (strongly) stable function. As a c...

متن کامل

Equitable Coloring of k-Uniform Hypergraphs

Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices into r parts, such that each edge of H intersects each part. A strong r-coloring is called equitable if the size of each part is dn/re or bn/rc. We prove that for all a ≥ 1, if the maximum degree of H satisfies ∆(H) ≤ k then H has an equitable coloring with k a ln k (1 − ok(1)) parts. In particul...

متن کامل

Vertex-Context Sampling for Weighted Network Embedding

Network embedding methods have garnered increasing aŠention because of their e‚ectiveness in various information retrieval tasks. Œe goal is to learn low-dimensional representations of vertexes in an information network and simultaneously capture and preserve the network structure. Critical to the performance of a network embedding method is how the edges/vertexes of the network is sampled for ...

متن کامل

Intersections among P ( 3 ) ( 2 , 4 ) - Designs 1

A path-hypergraph P (3)(2, 4) is the uniform hypergraph of rank 3, having four vertices and two edges, with exactly two vertices in common. In this paper, the intersection problem among P (3)(2, 4)-designs of order v is studied and completely solved for every admissible v. Mathematics Subject Classification: 05B05

متن کامل

Hamilton decompositions of complete 3-uniform hypergraphs

A k−uniform hypergraphH is a pair (V, ε), where V = {v1, v2, . . . , vn} is a set of n vertices and ε is a family of k-subset of V called hyperedges. A cycle of length l of H is a sequence of the form (v1, e1, v2, e2, . . . , vl, el, v1), where v1, v2, . . . , vl are distinct vertices, and e1, e2, . . . , el are k-edges of H and vi, vi+1 ∈ ei, 1 ≤ i ≤ l, where addition on the subscripts is modu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008