24,671 Hits in 4.9 sec

Survey of semi-regular multiresolution models for interactive terrain rendering

Renato Pajarola, Enrico Gobbetti
2007 The Visual Computer  
After providing a short background and motivation for the methods, we focus on illustrating models based on tiled blocks and nested regular grids, quadtrees and triangle bin-trees triangulations, as well  ...  as cluster based approaches.  ...  linearly interpolated from the base corner vertex data.  ... 
doi:10.1007/s00371-007-0163-2 fatcat:35bhc4dkp5a4pfobakir37supq

Data Compression of Multiresolution Surfaces [article]

Reinhard Klein, Stefan Gumhold
1998 Visualization in Scientific Computing '98  
In this paper we introduce a new compressed representation for multiresolution models (MRM) of triangulated surfaces of 3D-objects.  ...  It applies to MRMs generated by di erent simpli cation algorithms like local vertex deletion or edge and triangle collapse.  ...  Satellite elevation data forms the landscape model. All multiresolution models were produced by a simpli cation algorithm based on vertex decimation.  ... 
doi:10.2312/vissym19981001 fatcat:txbhpgyhordkflkkh2bakpieuq

LOD-based clustering techniques for efficient large-scale terrain storage and visualization

Xiaohong Bao, Renato Pajarola, Robert F. Erbacher, Philip C. Chen, Jonathan C. Roberts, Matti T. Groehn, Katy Boerner
2003 Visualization and Data Analysis 2003  
Organization of terrain data on disk is quite difficult because the error, the triangulation dependency and the spatial location of each vertex all need to be considered.  ...  Previous terrain clustering algorithms did not consider the per-vertex approximation error of individual terrain data sets.  ...  We adopt the notion of a quadtree based triangulation 5 that uses the dependency relation 4 to guarantee crack-free conforming LOD triangulations.  ... 
doi:10.1117/12.473936 dblp:conf/vda/BaoP03 fatcat:vvjnq2qgw5cwnltzwkf4rekpmi

Fast approximating triangulation of large scattered datasets

H. Weimer, J. Warren
1999 Advances in Engineering Software  
At the end of this document we will introduce extensions of this approximation method to higher-dimensional dependent data-sets.  ...  Three different methods for choosing triangulation vertices are presented, based on interpolation, and ¢ ¤ £ and ¢ ¦ ¥ -optimization of the error over subsets of the datapoints.  ...  The data used in the evaluation of our algorithms is courtesy of Western Geophysical and the Society of Exploration Geophysicists.  ... 
doi:10.1016/s0965-9978(98)00095-7 fatcat:5ygbo7dht5evjf6dxcfa4a3ok4

cellGPU: Massively parallel simulations of dynamic vertex models

Daniel M. Sussman
2017 Computer Physics Communications  
Vertex models represent confluent tissue by polygonal or polyhedral tilings of space, with the individual cell interacting via force laws that depend on both the geometry of the cells and the topology  ...  This dependence on the connectivity of the cellular network introduces several complications to performing molecular-dynamics-like simulations of vertex models, and in particular makes parallelizing the  ...  That is, a thread that has to read data from many different parts of a given array -e.g., reading off the vertex positions for cells close to a given cell from an un-ordered array of vertex data in order  ... 
doi:10.1016/j.cpc.2017.06.001 fatcat:tq3mdokrs5hszaaamzszgd4kkm

Scalable Linear Predictive Coding of Time-Consistent 3D Mesh Sequences

Nikolce Stefanoski, Xiaoliang Liu, Patrick Klie, Jorn Ostermann
2007 2007 3DTV Conference  
Prediction is performed vertex-wise from coarse to fine layers exploiting the motion of already encoded 1-ring neighbor vertices for prediction of the current vertex location.  ...  Following the predictive coding paradigm, local temporal and spatial dependencies between layers and frames are exploited for compression.  ...  Note that different triangulations can lead to different deviations, since valences of vertices v change depending on the triangulation t.  ... 
doi:10.1109/3dtv.2007.4379461 fatcat:x32clfzrmnabfg2b5ljikar2k4

Efficiently computing and updating triangle strips for real-time rendering

J. El-Sana, F. Evans, A. Kalaiah, A. Varshney, S. Skiena, E. Azanli
2000 Computer-Aided Design  
In this paper we present a novel data-structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes.  ...  A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression.  ...  Our work is most directly applicable to view-dependent simplifications that are based upon the vertex-split/edge-collapse primitive; its extension to more general view-dependent simplifications is a part  ... 
doi:10.1016/s0010-4485(00)00071-3 fatcat:vnghnc2ssvhrpmqzsrxg4q35oe

Data Compression of Multiresolution Surfaces [chapter]

Reinhard Klein, Stefan Gumhold
1998 Eurographics  
In this paper we i n troduce a new compressed representation for multiresolution models MRM of triangulated surfaces of 3D-objects.  ...  It applies to MRMs generated by di erent simpli cation algorithms like local vertex deletion or edge and triangle collapse.  ...  as necessary for view-dependent visualization.  ... 
doi:10.1007/978-3-7091-7517-0_2 fatcat:d5g42rwwhnbvjdgl7nxu4krlmu

Generation of Triangle Meshes from Time-of-Flight Data for Surface Registration [chapter]

Thomas Kilgus, Thiago R. dos Santos, Alexander Seitel, Kwong Yung, Alfred M. Franz, Anja Groch, Ivo Wolf, Hans-Peter Meinzer, Lena Maier-Hein
2011 Bildverarbeitung für die Medizin 2011  
Time-of-Flight cameras can provide the required surface data during the intervention as a point cloud.  ...  The matching is based on so-called curvature descriptors assigned to the vertices of the two meshes. Therefore, high compliance of the input meshes with respect to curvature properties is essential.  ...  -Four-point scheme based triangulation: (Fig. 1e) In this method the middle vertex interpolation is based on the subdivision scheme presented by Kobbelt [5] .  ... 
doi:10.1007/978-3-642-19335-4_40 dblp:conf/bildmed/KilgusSSYFGWMM11 fatcat:ggfypj3b75f2bf4mtzdboa5prq

Triangulation Data Structures [chapter]

Luca Castelli Aleardi, Olivier Devillers, Jarek Rossignac
2015 Encyclopedia of Algorithms  
The choice of the data structure should also depend on the simplicity of its implementation and on its practical efficiency on common input data.  ...  (a) Triangle-based data structure: each triangle stores references to the 3 neighbors and to the 3 incident vertices yielding 13rpv.  ... 
doi:10.1007/978-3-642-27848-8_589-1 fatcat:rjd26hh2n5hmjnebfeybr73fva

Data-Dependent Triangulation in the Plane with Adaptive Knot Placement [chapter]

R. Schätzl, H. Hagen, J. F. Barnes, B. Hamann, K. I. Joy
2001 Geometric Modelling  
We present a data-dependent triangulation scheme using a Sobolev norm to measure error instead of the more commonly used root-mean-square (RMS) error.  ...  We describe a scheme for constructing a hierarchy of triangulations that approximates a given data set at varying levels of resolution.  ...  The data-dependent triangulation scheme we describe in this paper is based on the principle of refinement.  ... 
doi:10.1007/978-3-7091-6270-5_18 dblp:conf/gm/SchatzlHBHJ99 fatcat:c4foc6v7mjhwzkudb2dwzq2nr4

Application of 3D Delaunay Triangulation in Fingerprint Authentication System [chapter]

Wencheng Yang, Guanglou Zheng, Ahmed Ibrahim, Junaid Chaudhry, Song Wang, Jiankun Hu, Craig Valli
2018 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
In this paper, we propose a 3D Delaunay triangulation based fingerprint authentication system as an improvement to improve the authentication performance without adding extra sensor data.  ...  A number of methods based on Delaunay triangulation have been proposed for minutiaebased fingerprint matching, due to some favorable properties of the Delaunay triangulation under image distortion.  ...  Once the top vertex D is determined, the triangle ∆ABC is defined as the base.  ... 
doi:10.1007/978-3-319-90775-8_23 fatcat:tpnsd2isubfv3axk2or6iriene

N-dimensional Data-Dependent Reconstruction Using Topological Changes [chapter]

Zsolt Tóth, Ivan Viola, Andrej Ferko, Eduard Gröller
2007 Mathematics and Visualization  
It is the generalization of a 2D reconstruction approach based on data-dependent triangulation and Lawson's optimization procedure.  ...  We introduce a new concept for a geometrically based feature preserving reconstruction technique of n-dimensional scattered data.  ...  This idea is called vertex-based data dependent triangulation, and it is a useful improvement of the basic approach.  ... 
doi:10.1007/978-3-540-70823-0_13 fatcat:mz62n4hu3nai5csdna7zruegt4


K. Kumar, H. Ledoux, J. Stoter
2016 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
The classical (face and edge based) and compact (star based) data structures are discussed at length with reference to their structure, advantages and limitations in handling massive triangulations and  ...  Our study is useful in identifying what are the limitations of the existing data structures for storing massive TINs and what is required to optimise these structures for managing massive triangulations  ...  The classical (face and edge based) and compact (star based) data structures are discussed at length with reference to their structure, advantages and limitations in handling massive triangulations.  ... 
doi:10.5194/isprs-archives-xli-b2-123-2016 fatcat:tl26f5apkzhkzmxf4eyhdsc32q

Hierarchical representation and coding of surfaces using 3-D polygon meshes

I. Kompatsiaris, D. Tzovaras, M.G. Strintzis
2001 IEEE Transactions on Image Processing  
Depending on its interpolation error and the available bitrate, each filtered sample is a candidate for becoming a vertex of the mesh.  ...  The proposed procedure is based on pyramidal analysis using the quincunx sampling minimum variance interpolation (QMVINT) filters.  ...  The resulting quincunx sampling-based triangulation procedure is similar to quadtree-based triangulation [14] .  ... 
doi:10.1109/83.935030 pmid:18255531 fatcat:657oag635jdnrkz4llp7uegnru
« Previous Showing results 1 — 15 out of 24,671 results