Sciweavers

2342 search results - page 283 / 469
» Sublinear geometric algorithms
Sort
View
146
Voted
CGF
2004
175views more  CGF 2004»
15 years 3 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
150
Voted
CVGIP
2004
175views more  CVGIP 2004»
15 years 3 months ago
A subdivision-based deformable model for surface reconstruction of unknown topology
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
Ye Duan, Hong Qin
116
Voted
COMGEO
1999
ACM
15 years 3 months ago
Simplifying spline models
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
M. Gopi, Dinesh Manocha
130
Voted
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 1 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox