Sciweavers

262 search results - page 10 / 53
» Conformal Mapping in Linear Time
Sort
View
IJCGA
2000
64views more  IJCGA 2000»
13 years 7 months ago
High Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
Scott A. Mitchell
ICDE
2007
IEEE
116views Database» more  ICDE 2007»
14 years 8 months ago
MultiMap: Preserving disk locality for multidimensional datasets
MultiMap is an algorithm for mapping multidimensional datasets so as to preserve the data's spatial locality on disks. Without revealing disk-specific details to applications...
Minglong Shao, Steven W. Schlosser, Stratos Papado...
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
13 years 11 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
ESANN
2004
13 years 8 months ago
Linearization identification and an application to BSS using a SOM
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
Fabian J. Theis, Elmar Wolfgang Lang
DCG
2010
73views more  DCG 2010»
13 years 7 months ago
Optimal Angle Bounds for Quadrilateral Meshes
We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classifica...
Christopher J. Bishop