Sciweavers

98 search results - page 3 / 20
» A Rectilinearity Measurement for Polygons
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Fast Polygonal Integration and Its Application in Extending Haar-like Features to Improve Object Detection
The integral image is typically used for fast integrating a function over a rectangular region in an image. We propose a method that extends the integral image to do fast integrat...
Minh-Tri Pham, Viet-Dung Hoang, Tat-Jen Cham, Yang...
COMPGEOM
1994
ACM
13 years 10 months ago
Competitive Searching in a Generalized Street
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
Amitava Datta, Christian Icking
ICPR
2004
IEEE
14 years 6 months ago
A Symmetric Convexity Measure
A new area-based convexity measure for polygons is described. It has the desirable properties that it is not sensitive to small boundary defects, and it is symmetric with respect ...
Paul L. Rosin, Christine L. Mumford
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
13 years 11 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
ICPR
2000
IEEE
14 years 6 months ago
Evaluation of Curve Length Measurements
This paper compares two techniques for measuring the length of a digital curve. Both techniques (digital straight segment approximation, minimum length polygon) are known to be co...
Reinhard Klette, Ben Yip