Sciweavers

885 search results - page 69 / 177
» Optimal Polygon Placement
Sort
View
ICCSA
2004
Springer
14 years 3 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
COMPGEOM
1999
ACM
14 years 2 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
GLOBECOM
2008
IEEE
14 years 4 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
INFOCOM
2007
IEEE
14 years 4 months ago
Distributed Placement of Service Facilities in Large-Scale Networks
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
Nikolaos Laoutaris, Georgios Smaragdakis, Konstant...
PODC
2006
ACM
14 years 4 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...