Sciweavers

3890 search results - page 15 / 778
» Computation of unirational fields
Sort
View
CGF
2008
153views more  CGF 2008»
13 years 7 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 7 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
CIE
2010
Springer
13 years 7 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
GIS
2002
ACM
13 years 7 months ago
Design of field wrappers for mobile field data collection
In mobile field data collection, data gatherer requires to get geospatial information service to support in navigating to the right locations, describing context of observed objec...
Peisheng Zhao, Sarah Nusser, Leslie L. Miller
CGF
2004
175views more  CGF 2004»
13 years 7 months ago
DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
Avneesh Sud, Miguel A. Otaduy, Dinesh Manocha