73 search results - page 1 / 15 » Efficient and small representation of line arrangements with... |
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
DCG
2008
13 years 7 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a document understanding system in which the arrangement of lines of text and block separators within a document are modeled by stochastic context free grammars. A gram...
WWW
2001
ACM
14 years 8 months ago
2001
ACM
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...