Sciweavers

1200 search results - page 43 / 240
» Marked Ancestor Problems
Sort
View
SWAT
2010
Springer
269views Algorithms» more  SWAT 2010»
14 years 3 months ago
Approximation Algorithms for Free-Label Maximization
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
Mark de Berg, Dirk H. P. Gerrits
AUIC
2002
IEEE
14 years 2 months ago
Computer-Aided Sketching to Capture Preliminary Design
This paper describes the vital role of freehand sketching in the design process. When designers first tackle a design problem they usually do so by sketching. We will explore the ...
Mark D. Apperley, Beryl Plimmer
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
14 years 2 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
CCCG
2007
13 years 11 months ago
Largest Subsets of Triangles in a Triangulation
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) ...
Boris Aronov, Marc J. van Kreveld, Maarten Lö...
ICRA
2007
IEEE
188views Robotics» more  ICRA 2007»
14 years 4 months ago
The Corridor Map Method: Real-Time High-Quality Path Planning
— A central problem in robotics is planning a collision-free path for a moving object in an environment with obstacles. Contemporary applications require a path planner that is f...
Roland Geraerts, Mark H. Overmars