Sciweavers

138 search results - page 11 / 28
» K-Guarding Polygons on the Plane
Sort
View
SI3D
2005
ACM
14 years 1 months ago
Sketching mesh deformations
Techniques for interactive deformation of unstructured polygon meshes are of fundamental importance to a host of applications. Most traditional approaches to this problem have emp...
Youngihn Kho, Michael Garland
ICCSA
2004
Springer
14 years 1 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
14 years 8 months ago
Complex tilings
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...
Bruno Durand, Leonid A. Levin, Alexander Shen
SWAT
2010
Springer
218views Algorithms» more  SWAT 2010»
14 years 22 days ago
Optimal Exploration of Terrains with Obstacles
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. W...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...
GD
1999
Springer
13 years 12 months ago
Visibility Representations of Complete Graphs
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
Robert Babilon, Helena Nyklová, Ondrej Pang...