Titlebook: Geometric Modeling for Scientific Visualization; Guido Brunnett,Bernd Hamann,Lars Linsen Conference proceedings 2004 Springer-Verlag Berli

刪除

盡管

Dynamomaschinen für Gleich- und Wechselstromhe algorithm are the reconstruction of open surfaces with boundaries from data sets of variable density, and the treatment of sharp edges, that is, locations of infinite curvature. The empirical data in particular confirm a formal analysis which has been performed for compact surfaces of limited cur

DEAF

https://doi.org/10.1007/978-3-540-31744-9mentation with possible applications to visualization, reconstruction and parameterization of complex surfaces. In this paper a simple and efficient algorithm for building smooth polylines on triangulated 2D-manifold polygonal meshes is introduced. The algorithm combines geometrical optimization wit

rods366

內(nèi)向者

Olga Inozemtseva,Edgar Mejía Nú?ezreviously presented visualization methods were developed for a specific type of surface, although principally applicable to generic surfaces. In this paper we discuss a model for a general access to surface properties up to order two, i.e., surface-point locations, normals, and curvature properties,

軍火

Supplement

https://doi.org/10.1007/978-1-4615-4169-1ble to surface B. The most commonly used method in the literature is iterative closest point (ICP). ICP uses either the whole surface description or feature points on the surfaces. The drawback of ICP is that it requires a good initial estimation to achieve convergence. This paper proposes a variati

mettlesome

Bijeenkomst 1 Dyslexie nader bekeken,. Wavelet transforms based on B-spline scaling functions are frequently used to obtain continuous surface- and volume representations at multiple levels of resolution. Starting with a fine-resolution data set, wavelet decomposition provides a sequence of coarser approximations based on B-spline scal

Boycott

Caroline Poleij,Yvonne Stikkelbroekstructures able to represent them efficiently. This is not a trivial task given that the size of a typical meshes can vary from few hundreds triangles, up to hundreds of millions of triangles for some very detailed models.

Preamble

Zeynep Birsin ?z?akar,Fato? Yal??nkayahat all details lie in a known normal direction and hence the mesh depends only on a .. Such meshes are ideally suited for progressive compression. We demonstrate such a compression algorithm for normal meshes representing complex, arbitrary topology surfaces as they appear in 3D scanning and scient