Linear data structures for two types of range search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Searching for empty convex polygons
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Arrangements of lines in 3-space: a data structure with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangles in space or building (and analyzing) castles in the Air
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Binary partitions with applications to hidden surface removal and solid modelling
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Sweeping arrangements of curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Graphics (TOG)
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
The visibility complex made visibly simple: an introduction to 2D structures of visibility
Proceedings of the eleventh annual symposium on Computational geometry
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multi-criteria geometric optimization problems in layered manufacturing
Proceedings of the fourteenth annual symposium on Computational geometry
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Lower bounds for set intersection queries
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A sum of squares theorem for visibility
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
Nordic Journal of Computing
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Robust shape fitting via peeling and grating coresets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On approximate range counting and depth
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the least quartile difference estimator in the plane
Computational Statistics & Data Analysis
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Combinatorics, Probability and Computing
Polytope range searching and integral geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Topological sweep of the complete graph
Discrete Applied Mathematics
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
On the qualitative structure of a mechanical assembly
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Approximation algorithms for speeding up dynamic programming and denoising aCGH data
Journal of Experimental Algorithmics (JEA)
Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Optimal area-sensitive bounds for polytope approximation
Proceedings of the twenty-eighth annual symposium on Computational geometry
Heuristics and bounds for the travelling salesman location problem on the plane
Operations Research Letters
Range searching on uncertain data
ACM Transactions on Algorithms (TALG)
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
Unions of onions: preprocessing imprecise points for fast onion layer decomposition
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |