scholarly journals Surface Meshes Smoothing

2009 ◽  
Author(s):  
Arnaud Gelas ◽  
Alexandre Gouaillard ◽  
sean megason
Keyword(s):  
Data Structure ◽  
Surface Smoothing ◽  
Mesh Surface ◽  
Smoothing Filter ◽  
Surface Data ◽  
Surface Meshes

This paper describes the implementation of a surface smoothing filter in ITK, based ont he Quad Edge Mesh surface data structure.

scholarly journals OVERLAYING SURFACE MESHES, PART I: ALGORITHMS

2004 ◽  
Vol 14 (06) ◽  
pp. 379-402 ◽  
Author(s):  
XIANGMIN JIAO ◽  
MICHAEL T. HEATH
Keyword(s):  
Data Structure ◽  
Error Analysis ◽  
Arbitrary Shape ◽  
Linear Complexity ◽  
Time And Space ◽  
Important Data ◽  
Combinatorial Structures ◽  
Robust Algorithm ◽  
Surface Meshes

We describe an efficient and robust algorithm for computing a common refinement of two meshes modeling the same surface of arbitrary shape by overlaying them on top of each other. A common refinement is an important data structure for transferring data between meshes that have different combinatorial structures. Our algorithm is optimal in time and space, with linear complexity, and is robust even with inexact computations, through the techniques of error analysis, detection of topological inconsistencies, and automatic resolution of such inconsistencies. We present the verification and some further enhancement of robustness in Part II.

Genetic algorithms for mesh surface smoothing

2015 ◽  
Author(s):  
Mehmet Yasin Özsağlam ◽  
Mehmet Çunkaş
Keyword(s):  
Genetic Algorithms ◽  
Surface Smoothing ◽  
Mesh Surface

scholarly journals Surface Meshes Incremental Decimation Framework

2008 ◽  
Author(s):  
Arnaud Gelas ◽  
Alexandre Gouaillard ◽  
Sean Megason
Keyword(s):  
Data Structure ◽  
General Framework ◽  
Computational Time ◽  
Surface Mesh ◽  
Surface Meshes ◽  
Mesh Decimation ◽  
Vertex Removal ◽  
Edge Collapse

When dealing with meshes, it is often preferable to work with a lower resolution mesh for computational time purpose, display. The process of reducing a given mesh, mesh decimation, is thus an important step in most of pipeline dealing with meshes. Incremental decimation algorithms, the most popular ones, consists of iteratively removing one point of the mesh, by Euler operations such as vertex removal or edge collapse. Here we focus on edge collapse based decimation approaches and propose a general framework based on a surface mesh data structure (itk::QuadEdgeMesh [3]). Our implementation intends to be as general and as flexible as possible. Indeed it can theoretically be applied on any polygonal mesh1; the measure, functional to be optimized at each iteration, the objective to be reached, and optional methods like point relocation to enhance the geometry of the resulting mesh, are given by the user. We provide here two specific implementations: itk::QuadEdgeMeshSquaredEdgeLengthDecimation and itk::QuadEdgeMeshQuadricDecimation, that could be used as example to implement additional algorithms.

A Data Structure for Disjoint Sets

Genomic Perl ◽  
2002 ◽  
pp. 313-317
Keyword(s):  
Data Structure ◽  
Disjoint Sets

Latent psychological data structure of secondary driving tasks

2004 ◽  
Author(s):  
Reates Curry
Keyword(s):  
Data Structure ◽  
Psychological Data

Distributed Modeling Of Building Systems Through Cyber-Physical Integration

2019 ◽  
pp. 12-17
Keyword(s):  
Data Structure ◽  
Operating Conditions ◽  
Physical Models ◽  
Distributed Model ◽  
Physical Processes ◽  
Distributed Modeling ◽  
Distributed Models ◽  
Operating Modes ◽  
Building Systems ◽  
Important Practical Application

This article describes the proposed approaches to creating distributed models that can, with given accuracy under given restrictions, replace classical physical models for construction objects. The ability to implement the proposed approaches is a consequence of the cyber-physical integration of building systems. The principles of forming the data structure of designed objects and distributed models, which make it possible to uniquely identify the elements and increase the level of detail of such a model, are presented. The data structure diagram of distributed modeling includes, among other things, the level of formation and transmission of signals about physical processes inside cyber-physical building systems. An enlarged algorithm for creating the structure of the distributed model which describes the process of developing a data structure, formalizing requirements for the parameters of a design object and its operating modes (including normal operating conditions and extreme conditions, including natural disasters) and selecting objects for a complete group that provides distributed modeling is presented. The article formulates the main approaches to the implementation of an important practical application of the cyber-physical integration of building systems - the possibility of forming distributed physical models of designed construction objects and the directions of further research are outlined.

A Maximal Local Maximum-Sum Segment Data Structure

2018 ◽  
Vol E101.A (9) ◽  
pp. 1541-1542
Author(s):  
Yoshifumi SAKAI
Keyword(s):  
Data Structure ◽  
Local Maximum ◽  
Segment Data

The research of semantic information retrieval for Mongolian data structure

2014 ◽  
Author(s):  
Yila Su ◽  
Chuan Fan ◽  
Hongbo Chen ◽  
Xiulan Xie ◽  
Haitao Liu
Keyword(s):  
Information Retrieval ◽  
Data Structure ◽  
Semantic Information ◽  
Semantic Information Retrieval

Flexible telecommand using standard on-board data structure

1983 ◽  
Author(s):  
C. GREEN ◽  
R. ALLEN
Keyword(s):  
Data Structure
Sign in / Sign up

Export Citation Format

Share Document