Sciweavers

IJCGA
2010
91views more  IJCGA 2010»
13 years 1 months ago
Pareto Envelopes in Simple Polygons
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann ...
IJCGA
2010
99views more  IJCGA 2010»
13 years 1 months ago
A Covering Projection for Robot Navigation under Strong anisotropy
Path planning can be subject to different types of optimization. Some years ago a German researcher, U. Leuth
Andrea Anghinolfi, Luca Costa, Massimo Ferri, Enri...
IJCGA
2010
78views more  IJCGA 2010»
13 years 1 months ago
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
Bill Jackson, Tibor Jordán
IJCGA
2010
96views more  IJCGA 2010»
13 years 1 months ago
Frameworks Symmetry and Rigidity
Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in Rd . These form the basis for a short proof of the FowlerGuest symmetry group generalisation of...
John C. Owen, Steve C. Power
IJCGA
2010
49views more  IJCGA 2010»
13 years 2 months ago
Smoothing Imprecise 1.5D Terrains
Chris Gray, Maarten Löffler, Rodrigo I. Silve...
IJCGA
2010
86views more  IJCGA 2010»
13 years 2 months ago
Leaving an Unknown Maze Using an Error-Prone Compass
Imagine you are trapped in a maze of caves. All you have is an old rusty compass and barely enough light to read it. How much inaccuracy can you allow to ensure that you can leave...
Tom Kamphans, Elmar Langetepe
IJCGA
2010
155views more  IJCGA 2010»
13 years 2 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
IJCGA
2010
99views more  IJCGA 2010»
13 years 2 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
IJCGA
2010
71views more  IJCGA 2010»
13 years 2 months ago
Almost Optimal Solutions to k-Clustering Problems
Pankaj Kumar, Piyush Kumar