How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...
We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R3 . We show that n 3 line segments in R3 admit 0,...
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
This paper presents a novel approach for the multi-oriented text line extraction from historical handwritten Arabic documents. Because of the multi-orientation of lines and their ...
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
This paper describes a document image analysis system using multiple agents working on a pyramid structure to separate text from graphics in the image. Text strings appear as diff...
Chew Lim Tan, Bo Yuan, Weihua Huang, Qian Wang, Zh...
We present a stereo-based obstacle avoidance system for mobile vehicles. The system operates in three steps. First, it models the surface geometry of supporting surface and remove...