Sciweavers

885 search results - page 12 / 177
» Optimal Polygon Placement
Sort
View
LATIN
2010
Springer
14 years 1 months ago
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
DAC
2003
ACM
14 years 1 months ago
Fast timing-driven partitioning-based placement for island style FPGAs
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
Pongstorn Maidee, Cristinel Ababei, Kia Bazargan
SIAMCO
2010
153views more  SIAMCO 2010»
13 years 3 months ago
Optimal Control for an Elliptic System with Polygonal State Constraints
This work is devoted to stationary optimal control problems with polygonal constraints on the components of the state. Existence of Lagrange multipliers, of different regularity, i...
Karl Kunisch, Kewei Liang, Xiliang Lu
TIP
1998
114views more  TIP 1998»
13 years 8 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
ICPR
2010
IEEE
13 years 6 months ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu