Sciweavers

1012 search results - page 11 / 203
» Segment intersection searching problems in general settings
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
CCCG
2003
13 years 8 months ago
Multidimensional Orthogonal Range Search Using Tries
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
Lingke Bu, Bradford G. Nickerson
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
COMPGEOM
1994
ACM
13 years 11 months ago
Competitive Searching in a Generalized Street
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
Amitava Datta, Christian Icking
COR
2007
163views more  COR 2007»
13 years 7 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke