Sciweavers

691 search results - page 19 / 139
» Axiomatizing geometric constructions
Sort
View
IM
2008
13 years 8 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
ICIP
2005
IEEE
14 years 10 months ago
Discrete bandelets with geometric orthogonal filters
This paper describes the construction of second generation bandelet orthogonal bases. The decomposition on a bandelet basis is computed using a wavelet filter bank followed by ada...
Gabriel Peyré, Stéphane Mallat
CAD
1998
Springer
13 years 8 months ago
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...
Xiao-Shan Gao, Shang-Ching Chou
CAD
2010
Springer
13 years 8 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
FOCM
2002
108views more  FOCM 2002»
13 years 8 months ago
Geometric Integration Algorithms on Homogeneous Manifolds
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
Debra Lewis, Peter J. Olver