Sciweavers

188 search results - page 28 / 38
» Pointed Drawings of Planar Graphs
Sort
View
ENDM
2011
227views Hardware» more  ENDM 2011»
12 years 7 months ago
Bichromatic Triangle Games
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V . Starting from no...
Gordana Manic, Daniel M. Martin, Milos Stojakovic
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 1 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SGP
2007
13 years 9 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
WG
2001
Springer
13 years 11 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...
ALGORITHMICA
2004
74views more  ALGORITHMICA 2004»
13 years 7 months ago
Three-Dimensional Layers of Maxima
Abstract. We present an O(n log n)-time algorithm to solve the threedimensional layers-of-maxima problem, an improvement over the prior O(n log n log log n)-time solution. A previo...
Adam L. Buchsbaum, Michael T. Goodrich