Sciweavers

279 search results - page 35 / 56
» Implicit Convex Polygons
Sort
View
IOR
2008
85views more  IOR 2008»
13 years 7 months ago
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria
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
COMPGEOM
1999
ACM
13 years 12 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...
CDC
2010
IEEE
166views Control Systems» more  CDC 2010»
12 years 11 months ago
Nuclear norm regularization for overparametrized Hammerstein systems
—In this paper we study the overparametrization scheme for Hammerstein systems [1] in the presence of regularization. The quality of the convex approximation is analysed, that is...
Tillmann Falck, Johan A. K. Suykens, Johan Schouke...
CA
1996
IEEE
13 years 12 months ago
Efficient And Accurate Interference Detection For Polynomial Deformation
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
Merlin Hughes, Christopher DiMattia, Ming C. Lin, ...