584 search results - page 57 / 117 » On the Number of Halving Planes |
170
click to vote
GMP
2008
IEEE
16 years 18 days ago
2008
IEEE
We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
159
click to vote
ICRA
2007
IEEE
16 years 14 days ago
2007
IEEE
Abstract— In this paper we address the problem of determining the relative pose of pairs robots that move on a plane while measuring the distance to each other. We show that the ...
170
click to vote
COCOA
2007
Springer
16 years 10 days ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
131
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
144
click to vote
GD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...