Sciweavers

6 search results - page 1 / 2
» On the density of iterated line segment intersections
Sort
View
COMGEO
2008
ACM
13 years 5 months ago
On the density of iterated line segment intersections
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
Ansgar Grüne, Sanaz Kamali
COMGEO
2006
ACM
13 years 5 months ago
A result about the density of iterated line intersections in the plane
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
Christopher J. Hillar, Darren L. Rhea
ICDAR
2009
IEEE
13 years 3 months ago
Handwritten Text Line Identification in Indian Scripts
Preprocessing in handwritten text OCR involves line, word and character segmentation. This paper deals with text line identification of handwritten Indian scripts, especially of B...
Bidyut Baran Chaudhuri, Sumedha Bera
CVPR
2006
IEEE
14 years 7 months ago
Structure and View Estimation for Tomographic Reconstruction: A Bayesian Approach
This paper addresses the problem of reconstructing the density of a scene from multiple projection images produced by modalities such as x-ray, electron microscopy, etc. where an ...
Satya P. Mallick, Sameer Agarwal, David J. Kriegma...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 7 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...