Sciweavers

329 search results - page 6 / 66
» On Range Searching with Semialgebraic Sets
Sort
View
COMPGEOM
2001
ACM
14 years 6 days ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
JAIR
2011
103views more  JAIR 2011»
13 years 3 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
CCCG
2008
13 years 10 months ago
Data Structures for Range-Aggregate Extent Queries
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...
ICCV
2011
IEEE
12 years 8 months ago
A robust pipeline for rapid feature-based pre-alignment of dense range scans
Aiming at reaching an interactive and simplified usage of high-resolution 3D acquisition systems, this paper presents a fast and automated technique for pre-alignment of dense ra...
Francesco Bonarrigo, Alberto Signoroni, Riccardo L...
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 8 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...