2342 search results - page 154 / 469 » Sublinear geometric algorithms |
162
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— This paper describes an efficient method for retrieving the 3-dimensional shape associated to novelties in the environment of an autonomous robot, which is equipped wi...
147
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
138
click to vote
DAGSTUHL
2003
15 years 4 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
111
click to vote
CGF
2005
15 years 3 months ago
2005
The concept of tiled displays can be successful only if such displays are made to look like a single display perceptually. The two issues that need to be solved to achieve this go...
113
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...