Sciweavers

102291 search results - page 140 / 20459
» Computability in Computational Geometry
Sort
View
ISBI
2006
IEEE
16 years 5 months ago
Fast marching method to correct for refraction in ultrasound computed tomography
A significant obstacle in the advancement of Ultrasound Computed Tomography has been the lack of efficient and precise methods for the tracing of the bent rays that result from th...
Shengying Li, Klaus Mueller, Marcel Jackowski, Don...
147
Voted
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 10 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 9 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
125
Voted
ENTCS
2002
101views more  ENTCS 2002»
15 years 4 months ago
Hypergeometric Functions in Exact Geometric Computation
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...
Zilin Du, Maria Eleftheriou, José E. Moreir...
ISVC
2010
Springer
15 years 3 months ago
Computer-Generated Tie-Dyeing Using a 3D Diffusion Graph
Abstract. Hand dyeing generates artistic representations with unique and complex patterns. The aesthetics of dyed patterns on a cloth originate from the physical properties of dyei...
Yuki Morimoto, Kenji Ono
« Prev « First page 140 / 20459 Last » Next »