Sciweavers

885 search results - page 42 / 177
» Optimal Polygon Placement
Sort
View
COMPGEOM
1995
ACM
14 years 1 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
VMV
2003
143views Visualization» more  VMV 2003»
13 years 11 months ago
Animating a Camera for Viewing a Planar Polygon
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
Daniel Brunstein, Gill Barequet, Craig Gotsman
CORR
2007
Springer
89views Education» more  CORR 2007»
13 years 10 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
INFOCOM
2012
IEEE
12 years 11 days ago
Algorithm design for femtocell base station placement in commercial building environments
Abstract—Although femtocell deployments in residential buildings have been increasingly prevalent, femtocell deployment in commercial building environments remains in its infancy...
Jia Liu, Qian Chen, Hanif D. Sherali
EUROPAR
2001
Springer
14 years 2 months ago
Loop-Carried Code Placement
Abstract. Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that...
Peter Faber, Martin Griebl, Christian Lengauer