Sciweavers

4761 search results - page 6 / 953
» Generalizing Boundary Points
Sort
View
CORR
2011
Springer
150views Education» more  CORR 2011»
13 years 2 months ago
Asymptotic Enumeration of Non-crossing Partitions on Surfaces
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing pa...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
ICCV
2007
IEEE
14 years 10 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....
DCG
2008
93views more  DCG 2008»
13 years 8 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
CSC
2010
13 years 6 months ago
Accuracy of the Immersed Boundary Method in Fixed-Point Arithmetic
Abstract-- The immersed boundary (IB) method is an algorithm for simulating elastic structures immersed in a fluid. The IB method can be used, for example, to simulate blood flow i...
Gabor Ferencz, Eric Peskin, Charles Peskin
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
14 years 10 days ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...