Sciweavers

86 search results - page 5 / 18
» Generalized Balanced Partitions of Two Sets of Points in the...
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 7 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
COMPGEOM
1991
ACM
13 years 11 months ago
Crossing Families
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
Boris Aronov, Paul Erdös, Wayne Goddard, Dani...
ACCV
2006
Springer
14 years 1 months ago
General Specular Surface Triangulation
We present a method for the reconstruction of a specular surface, using a single camera viewpoint and the reflection of a planar target placed at two different positions. Contrar...
Thomas Bonfort, Peter F. Sturm, Pau Gargallo
IPL
2008
104views more  IPL 2008»
13 years 7 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...