Sciweavers

598 search results - page 20 / 120
» The Puzzle Layout Problem
Sort
View
CCCG
2006
13 years 9 months ago
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
R. Sharathkumar, Prosenjit Gupta
MVA
1996
13 years 8 months ago
Recognition of Composite Elements in Bar Graphs
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...
Naoko Yokokura, Toyohide Watanabe
PPL
2000
91views more  PPL 2000»
13 years 7 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
WG
1999
Springer
13 years 11 months ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
ICCV
2005
IEEE
14 years 9 months ago
Detecting Irregularities in Images and in Video
We address the problem of detecting irregularities in visual data, e.g., detecting suspicious behaviors in video sequences, or identifying salient patterns in images. The term &qu...
Oren Boiman, Michal Irani