On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Testing for cycles in infinite graphs with periodic structure
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Numerical stability of geometric algorithms
SCG '87 Proceedings of the third annual symposium on Computational geometry
SCG '87 Proceedings of the third annual symposium on Computational geometry
File organizations & incrementally specified queries
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Efficient motion planning for an L-shaped object
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Probing a scene of non convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
Towards image realism with interactive update rates in complex virtual building environments
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Generating textures on arbitrary surfaces using reaction-diffusion
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
A gridless router for industrial design rules
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Planar geometric location problems and maintaining the width of a planar set
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
ACM SIGPLAN Notices
The Recovery and Understanding of a Line Drawing from Indoor Scenes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Searching tree structures on a mesh of processors
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Dynamic point location in general subdivisions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The robot localization problem in two dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dominance range-query: the one-reporting case
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Computing many faces in arrangements of lines and segments
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient agnostic PAC-learning with simple hypothesis
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
ACM SIGACT News
A combinatorial approach to cartograms
Proceedings of the eleventh annual symposium on Computational geometry
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Fast isocontouring for improved interactivity
Proceedings of the 1996 symposium on Volume visualization
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Primal-dual methods for vertex and facet enumeration (preliminary version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for set intersection queries
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Software engineering education: Rôles of formal specification and design calculi
Annals of Software Engineering - Special issue on software engineering education
Collision detection in aspect and scale bounded polyhedra
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Indexing schemes for random points
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
A provably efficient computational model for approximate spatiotemporal retrieval
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Compact interval trees: a data structure for convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Dynamization of geometric data structures
SCG '85 Proceedings of the first annual symposium on Computational geometry
Analyzing bounding boxes for object intersection
ACM Transactions on Graphics (TOG)
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Parallel processing for 2-1/2D machining simulation
Proceedings of the sixth ACM symposium on Solid modeling and applications
Lower bounds for intersection searching and fractional cascading in higher dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Real-time properties of indirect recursive procedures
Information and Computation
Semi-online maintenance of geometric optima and measures
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pseudo-line arrangements: duality, algorithms, and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Constraints in Graph Drawing Algorithms
Constraints
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Using Geometric Hashing To Repair CAD Objects
IEEE Computational Science & Engineering
Robust Set Operations on Polyhedral Solids
IEEE Computer Graphics and Applications
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
On R-trees with low query complexity
Computational Geometry: Theory and Applications
IEEE Transactions on Parallel and Distributed Systems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Interoperability of Data Parallel Runtime Libraries
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Optimal Facility Location under Various Distance Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Partitioning Colored Point Sets into Monochromatic Parts
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
2-D Spatial Indexing Scheme in Optimal Time
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Creating Semantic Representations of Diagrams
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Algorithms for Joining R-Trees and Linear Region Quadtrees
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Applications of the Generic Programming Paradigm in the Design of CGAL
Selected Papers from the International Seminar on Generic Programming
A Geometric Approach to Boolean Matrix Multiplication
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Decomposing non-manifold objects in arbitrary dimensions
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
A simple and scalable algorithm for the IP address lookup problem
Fundamenta Informaticae - Special issue on computing patterns in strings
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Lower bounds for intersection searching and fractional cascading in higher dimension
Journal of Computer and System Sciences - STOC 2001
A discipline of dynamic programming over sequence data
Science of Computer Programming - Methods of software design: Techniques and applications
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Artificial Intelligence Review
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Space efficient dynamic orthogonal range reporting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Table design in dynamic programming
Information and Computation
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Rotation and lighting invariant template matching
Information and Computation
On risks of using cuckoo hashing with simple universal hash classes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computing all skyline probabilities for uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Thread-based implementations of the false nearest neighbors method
Parallel Computing
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Journal of the ACM (JACM)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
A new randomized data structure for the 11/2-dimensional range query problem
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Guaranteeing safety in spatially situated agents
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Algorithms and theory of computation handbook
Cloning Voronoi diagrams via retroactive data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Combining traditional map labeling with boundary labeling
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Asymptotically efficient algorithms for skyline probabilities of uncertain data
ACM Transactions on Database Systems (TODS)
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
k-enclosing axis-parallel square
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Boundary labelling of optimal total leader length
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Minimum-sum dipolar spanning tree in R3
Computational Geometry: Theory and Applications
Computer Science Review
A Simple and Scalable Algorithm for the IP Address Lookup Problem
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |