Sciweavers

6393 search results - page 42 / 1279
» Randomized Algorithms on the Mesh
Sort
View
CCCG
2008
15 years 3 months ago
An Efficient Query Structure for Mesh Refinement
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
Benoît Hudson, Duru Türkoglu
PPSC
1997
15 years 3 months ago
Dynamic Load-Balancing for Parallel Adaptive Unstructured Meshes
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and atte...
Chris Walshaw, Mark Cross, M. G. Everett
86
Voted
CAD
2008
Springer
15 years 2 months ago
Identification of C1 and C2 discontinuities for surface meshes in CAD
In computer-aided design and meshing, it is often important to identify the discontinuities (singularities) in coarse surface meshes. Due to the potential low resolution and noise...
Xiangmin Jiao, Narasimha R. Bayyana
JCRD
2006
71views more  JCRD 2006»
15 years 1 months ago
Feature Preserving Mesh Simplification Based on Corner Cutting
Abstract Most of the existing algorithms for simplifying triangular meshes might lose some important shape features of the original model, especially at low levels of the simplifie...
Zhongping Ji, Ligang Liu, Guojin Wang
CGF
2010
132views more  CGF 2010»
15 years 2 months ago
Hybrid Booleans
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
Darko Pavic, Marcel Campen, Leif Kobbelt