1009 search results - page 196 / 202 » On Indexing Line Segments |
146
click to vote
NPAR
2004
ACM
15 years 9 months ago
2004
ACM
Algorithms that detect silhouettes, creases, and other edge based features often perform per-edge and per-face mesh computations using global adjacency information. These are unsu...
134
click to vote
DIAGRAMS
2004
Springer
15 years 9 months ago
2004
Springer
A composite cluster map displays a fuzzy categorisation of geographic areas. It combines information from several sources to provide a visualisation of the significance of cluster...
144
click to vote
ICFCA
2004
Springer
15 years 9 months ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
151
click to vote
SIGIR
2003
ACM
15 years 9 months ago
2003
ACM
The ability to find tables and extract information from them is a necessary component of data mining, question answering, and other information retrieval tasks. Documents often c...
130
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...