Sciweavers

1477 search results - page 147 / 296
» Complexity of (iterated) dominance
Sort
View
ICCSA
2004
Springer
15 years 12 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
3DIM
2003
IEEE
15 years 11 months ago
A Fast Point-to-Tangent Plane Technique for Multi-view Registration
This paper addresses a registration refinement problem and presents an accurate and fast Point-to-(Tangent) Plane technique. Point-to-Plane approach is known to be very accurate ...
Soon-Yong Park, Murali Subbarao
IMR
2003
Springer
15 years 11 months ago
Isotropic Remeshing of Surfaces: A Local Parameterization Approach
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
DATE
2002
IEEE
111views Hardware» more  DATE 2002»
15 years 11 months ago
A Linear-Centric Modeling Approach to Harmonic Balance Analysis
In this paper we propose a new harmonic balance simulation methodology based on a linear-centric modeling approach. A linear circuit representation of the nonlinear devices and as...
Peng Li, Lawrence T. Pileggi
COCOON
2001
Springer
15 years 11 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu