| Publication | Date of Publication | Type |
|---|
Stable approximation algorithms for dominating set and independent set
| 2025-01-14 | Paper |
Stable and dynamic minimum cuts
| 2024-07-19 | Paper |
Stable approximation algorithms for the dynamic broadcast range-assignment problem
| 2024-05-27 | Paper |
Euclidean TSP in narrow strips
Discrete \& Computational Geometry | 2024-05-21 | Paper |
On cyclic solutions to the min-max latency multi-robot patrolling problem
| 2024-05-14 | Paper |
Unlabeled multi-robot motion planning with tighter separation bounds
| 2024-05-14 | Paper |
Throughput and packet displacements of dynamic broadcasting algorithms
| 2024-04-05 | Paper |
Dominance in the presence of obstacles
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
SIAM Journal on Discrete Mathematics | 2024-02-27 | Paper |
Improved bounds for discrete Voronoi games
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788595 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788646 (Why is no real title available?)
| 2024-01-15 | Paper |
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model
| 2024-01-15 | Paper |
A note on reachability and distance oracles for transmission graphs
| 2023-12-16 | Paper |
The online broadcast range-assignment problem
Algorithmica | 2023-12-13 | Paper |
The Online Broadcast Range-Assignment Problem
| 2023-11-14 | Paper |
On β-Plurality Points in Spatial Voting Games.
| 2023-11-02 | Paper |
Euclidean TSP in narrow strips
| 2023-11-02 | Paper |
Preclustering Algorithms for Imprecise Points
| 2023-11-02 | Paper |
k-Center Clustering with Outliers in the Sliding-Window Model.
| 2023-09-20 | Paper |
An ETH-Tight Exact Algorithm for Euclidean TSP
SIAM Journal on Computing | 2023-06-09 | Paper |
Clique-based separators for geometric intersection graphs
Algorithmica | 2023-06-05 | Paper |
Linear size binary space partitions for fat objects
Lecture Notes in Computer Science | 2023-05-08 | Paper |
On one-round discrete voronoi games
| 2023-02-03 | Paper |
Computing the maximum overlap of two convex polygons under translations
| 2023-01-25 | Paper |
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
SWAT 90 | 2022-12-09 | Paper |
Translating polygons with applications to hidden surface removal
SWAT 90 | 2022-12-09 | Paper |
New results on binary space partitions in the plane (extended abstract)
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Models and motion planning
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Two- and three- dimensional point location in rectangular subdivisions
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Computing constrained minimum-width annuli of point sets
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Preclustering algorithms for imprecise points
Algorithmica | 2022-06-01 | Paper |
On β-Plurality Points in Spatial Voting Games
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Fine-grained Complexity Analysis of Two Classic TSP Variants
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Removing depth-order cycles among triangles: an algorithm generating triangular fragments
Discrete \& Computational Geometry | 2021-02-10 | Paper |
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
SIAM Journal on Computing | 2021-01-13 | Paper |
Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons
| 2021-01-12 | Paper |
Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
| 2020-11-25 | Paper |
Dynamic conflict-free colorings in the plane
| 2020-11-25 | Paper |
Shortcuts for the circle
| 2020-11-25 | Paper |
Faster DBScan and HDBscan in low-dimensional Euclidean spaces
| 2020-11-25 | Paper |
The dominating set problem in geometric intersection graphs
| 2020-05-27 | Paper |
Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
Algorithmica | 2020-04-01 | Paper |
Minimum perimeter-sum partitions in the plane
Discrete \& Computational Geometry | 2020-01-31 | Paper |
Geodesic spanners for points on a polyhedral terrain
SIAM Journal on Computing | 2019-12-19 | Paper |
An efficient algorithm for the 1D total visibility-index problem
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Covering many points with a small-area box
| 2019-09-10 | Paper |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
Algorithmica | 2019-05-21 | Paper |
The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds
Algorithmica | 2019-05-21 | Paper |
The complexity of dominating set in geometric intersection graphs
Theoretical Computer Science | 2019-04-23 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Finding pairwise intersections inside a query range
Algorithmica | 2019-01-11 | Paper |
Dynamic conflict-free colorings in the plane
Computational Geometry | 2018-12-07 | Paper |
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
An efficient algorithm for the 1D total visibility-index problem and its parallelization
ACM Journal of Experimental Algorithmics | 2018-11-20 | Paper |
Faster algorithms for computing plurality points
ACM Transactions on Algorithms | 2018-11-13 | Paper |
The priority R-tree: a practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Independent-set reconfiguration thresholds of hereditary graph classes
Discrete Applied Mathematics | 2018-10-26 | Paper |
Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces
| 2018-10-04 | Paper |
Range-clustering queries
| 2018-08-13 | Paper |
Minimum Perimeter-Sum Partitions in the Plane
| 2018-08-13 | Paper |
Geodesic spanners for points on a polyhedral terrain
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6876121 (Why is no real title available?)
| 2018-05-29 | Paper |
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
| 2018-05-07 | Paper |
Progressive geometric algorithms
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Independent-set reconfiguration thresholds of hereditary graph classes
| 2018-04-19 | Paper |
Faster algorithms for computing plurality points
| 2018-01-30 | Paper |
Fine-grained complexity analysis of two classic TSP variants
| 2017-12-19 | Paper |
Cache-oblivious R-trees
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Kinetic spanners in \(\mathbb{R}^d\)
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Kinetic sorting and kinetic convex hulls
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Vertical ray shooting for fat objects
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Visibility maps of realistic terrains have linear smoothed complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
A segment-tree based kinetic BSP
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Box-trees and R-trees with near-optimal query time
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Schematization of road networks
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Implicit flow routing on terrains with applications to surface networks and drainage structures
| 2017-09-29 | Paper |
The homogeneous broadcast problem in narrow and wide strips
| 2017-09-22 | Paper |
Guarding monotone art galleries with sliding cameras in linear time
Journal of Discrete Algorithms | 2017-07-13 | Paper |
Separability of imprecise points
Computational Geometry | 2017-07-05 | Paper |
Progressive geometric algorithms
| 2017-03-30 | Paper |
scientific article; zbMATH DE number 6698326 (Why is no real title available?)
| 2017-03-30 | Paper |
Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
| 2017-03-09 | Paper |
Fat polygonal partitions with applications to visualization and embeddings
| 2017-03-09 | Paper |
Visibility maps of realistic terrains have linear smoothed complexity
| 2017-03-09 | Paper |
Multi-method dispatching: a geometric approach with applications to string matching problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Conflict-free colorings for frequency allocation is wireless networks
Nieuw Archief voor Wiskunde. Vijfde Serie | 2016-09-07 | Paper |
On lazy randomized incremental construction
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Computing a single cell in the overlay of two simple polygons
Information Processing Letters | 2016-05-26 | Paper |
Distance-sensitive planar point location
Computational Geometry | 2016-05-17 | Paper |
Straight-path queries in trajectory data
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Separating bichromatic point sets by L-shapes
Computational Geometry | 2016-01-15 | Paper |
Computing push plans for disk-shaped robots
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Approximating minimum-area rectangular and convex containers for packing convex polygons
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Finding pairwise intersections inside a query range
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Guarding monotone art galleries with sliding cameras in linear time
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Piecewise linear paths among convex obstacles
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Straight-path queries in trajectory data
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Region-fault tolerant geometric spanners
| 2014-12-18 | Paper |
Separability of imprecise points
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Improved bounds for the union of locally fat objects in the plane
SIAM Journal on Computing | 2014-07-30 | Paper |
Treemaps with bounded aspect ratio
Computational Geometry | 2014-05-19 | Paper |
Better bounds on the union complexity of locally fat objects
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Kinetic convex hulls and Delaunay triangulations in the black-box model
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Labeling moving points with a trade-off between label speed and label overlap
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Distance-Sensitive Planar Point Location
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Optimal binary space partitions for segments in the plane
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Fast Fréchet queries
Computational Geometry | 2013-04-29 | Paper |
Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Unions of fat convex polytopes have short skeletons
Discrete \& Computational Geometry | 2012-08-13 | Paper |
Approximation algorithms for free-label maximization
Computational Geometry | 2012-05-18 | Paper |
The traveling salesman problem under squared Euclidean distances
| 2012-01-23 | Paper |
Treemaps with bounded aspect ratio
Algorithms and Computation | 2011-12-16 | Paper |
Fast Fréchet queries
Algorithms and Computation | 2011-12-16 | Paper |
Geometric spanners for weighted point sets
Algorithmica | 2011-08-16 | Paper |
On rectilinear partitions with minimum stabbing number
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Piecewise-linear approximations of uncertain functions
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Kinetic spanners in \(\mathbb R^{d}\)
Discrete \& Computational Geometry | 2011-06-03 | Paper |
Go with the flow: the direction-based Fréchet distance of polygonal curves
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Out-of-order event processing in kinetic data structures
Algorithmica | 2011-05-10 | Paper |
Kinetic kd-trees and longest-side kd-trees
SIAM Journal on Computing | 2010-09-06 | Paper |
Vertical ray shooting and computing depth orders for fat objects
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764843 (Why is no real title available?)
| 2010-08-06 | Paper |
Optimal binary space partitions in the plane
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Approximation algorithms for free-label maximization
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Cache-oblivious selection in sorted \(X+Y\) matrices
Information Processing Letters | 2010-06-09 | Paper |
Optimal BSPs and rectilinear cartograms
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
Significant-presence range queries in categorical data.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Streaming algorithms for line simplification
Discrete \& Computational Geometry | 2010-04-12 | Paper |
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry | 2010-03-16 | Paper |
Computing the visibility map of fat objects
Computational Geometry | 2010-03-16 | Paper |
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
Computational Geometry | 2010-03-11 | Paper |
Kinetic dictionaries: how to shoot a moving target
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Maximizing the area of overlap of two unions of disks under rigid motion
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Decompositions and boundary coverings of non-convex fat polyhedra
Computational Geometry | 2009-11-16 | Paper |
A simple and efficient kinetic spanner
Computational Geometry | 2009-11-16 | Paper |
Geometric Spanners for Weighted Point Sets
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Covering many or few points with unit disks
Theory of Computing Systems | 2009-09-02 | Paper |
Cache-oblivious R-trees
Algorithmica | 2009-05-13 | Paper |
Region-fault tolerant geometric spanners
Discrete \& Computational Geometry | 2009-05-06 | Paper |
Kinetic collision detection for convex fat objects
Algorithmica | 2009-05-06 | Paper |
On rectilinear duals for vertex-weighted plane graphs
Discrete Mathematics | 2009-04-09 | Paper |
Vertical Ray Shooting and Computing Depth Orders for Fat Objects
SIAM Journal on Computing | 2009-03-16 | Paper |
I/O-Efficient Flow Modeling on Fat Terrains
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Computing the Visibility Map of Fat Objects
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Kinetic KD-trees and longest-side KD-trees
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
A simple and efficient kinetic spanner
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Streaming algorithms for line simplification
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Efficient \(c\)-oriented range searching with DOP-trees
Computational Geometry | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506196 (Why is no real title available?)
| 2009-02-10 | Paper |
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Improved bounds on the union complexity of fat objects
Discrete \& Computational Geometry | 2008-09-24 | Paper |
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Computational Geometry | 2008-07-29 | Paper |
Sparse geometric graphs with small dilation
Computational Geometry | 2008-06-18 | Paper |
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
Algorithms and Computation | 2008-05-27 | Paper |
Computational geometry. Algorithms and applications.
| 2008-03-25 | Paper |
Out-of-Order Event Processing in Kinetic Data Structures
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Kinetic Collision Detection for Convex Fat Objects
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Covering Many or Few Points with Unit Disks
Approximation and Online Algorithms | 2008-02-21 | Paper |
Kinetic sorting and kinetic convex hulls
Computational Geometry | 2007-03-15 | Paper |
An intersection-sensitive algorithm for snap rounding
Computational Geometry | 2007-02-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Approximate range searching using binary space partitions
Computational Geometry | 2006-04-28 | Paper |
TSP with neighborhoods of varying size
Journal of Algorithms | 2005-11-16 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Schematization of networks
Computational Geometry | 2005-05-12 | Paper |
Optimal spanners for axis-aligned rectangles
Computational Geometry | 2005-02-09 | Paper |
Spanning trees crossing few barriers
Discrete \& Computational Geometry | 2004-02-05 | Paper |
On simplifying dot maps.
Computational Geometry | 2004-01-23 | Paper |
Guarding scenes against invasive hypercubes.
Computational Geometry | 2003-08-25 | Paper |
scientific article; zbMATH DE number 1947392 (Why is no real title available?)
| 2003-07-08 | Paper |
On the flatness of Minkowski sums
Information Processing Letters | 2003-06-24 | Paper |
On R-trees with low query complexity
Computational Geometry | 2003-04-28 | Paper |
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry | 2003-03-10 | Paper |
scientific article; zbMATH DE number 1870070 (Why is no real title available?)
GeoInformatica | 2003-02-17 | Paper |
Realistic input models for geometric algorithms
Algorithmica | 2002-12-01 | Paper |
Box-trees and R-trees with near-optimal query time
Discrete \& Computational Geometry | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1830727 (Why is no real title available?)
| 2002-11-18 | Paper |
Models and motion planning
Computational Geometry | 2002-09-03 | Paper |
scientific article; zbMATH DE number 1670656 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1568057 (Why is no real title available?)
| 2001-02-21 | Paper |
Lower bounds for kinetic planar subdivisions
Discrete \& Computational Geometry | 2000-12-19 | Paper |
Linear size binary space partitions for uncluttered scenes
Algorithmica | 2000-12-03 | Paper |
Computing the Angularity Tolerance
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1433426 (Why is no real title available?)
| 2000-04-18 | Paper |
Motion planning for multiple robots
Discrete \& Computational Geometry | 1999-11-25 | Paper |
The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
Computational Geometry | 1999-05-17 | Paper |
Motion planning in environments with low obstacle density
Discrete \& Computational Geometry | 1999-01-13 | Paper |
Computing the maximum overlap of two convex polygons under translations
Theory of Computing Systems | 1998-11-11 | Paper |
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing | 1998-05-10 | Paper |
New results on binary space partitions in the plane
Computational Geometry | 1997-10-28 | Paper |
Trekking in the alps without freezing or getting tired
Algorithmica | 1997-07-23 | Paper |
scientific article; zbMATH DE number 1033560 (Why is no real title available?)
| 1997-07-14 | Paper |
Perfect binary space partitions
Computational Geometry | 1997-03-18 | Paper |
Reaching a goal with directional uncertainty
Theoretical Computer Science | 1997-02-28 | Paper |
Generalized hidden surface removal
Computational Geometry | 1996-07-14 | Paper |
Computing half-plane and strip discrepancy of planar point sets
Computational Geometry | 1996-07-14 | Paper |
Point location in zones of \(k\)-flats in arrangements
Computational Geometry | 1996-07-14 | Paper |
scientific article; zbMATH DE number 871907 (Why is no real title available?)
| 1996-04-28 | Paper |
TRANSLATION QUERIES FOR SETS OF POLYGONS
International Journal of Computational Geometry & Applications | 1996-04-16 | Paper |
Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
Journal of Algorithms | 1996-02-26 | Paper |
Vertical decompositions for triangles in 3-space
Discrete \& Computational Geometry | 1996-02-13 | Paper |
CUTTINGS AND APPLICATIONS
International Journal of Computational Geometry & Applications | 1996-02-01 | Paper |
On lazy randomized incremental construction
Discrete \& Computational Geometry | 1995-11-29 | Paper |
Piecewise linear paths among convex obstacles
Discrete \& Computational Geometry | 1995-08-01 | Paper |
Rectilinear decompositions with low stabbing number
Information Processing Letters | 1995-01-09 | Paper |
Efficient ray shooting and hidden surface removal
Algorithmica | 1994-08-10 | Paper |
Computing and Verifying Depth Orders
SIAM Journal on Computing | 1994-05-10 | Paper |
Ray shooting, depth orders and hidden surface removal
Lecture Notes in Computer Science | 1993-12-06 | Paper |
SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
Computational Geometry | 1992-12-16 | Paper |
Hidden surface removal for \(c\)-oriented polyhedra
Computational Geometry | 1992-09-27 | Paper |
A general approach to dominance in the plane
Journal of Algorithms | 1992-06-28 | Paper |
Finding squares and rectangles in sets of points
BIT | 1991-01-01 | Paper |
On rectilinear link distance
Computational Geometry | 1991-01-01 | Paper |
Maintaining range trees in secondary memory. Part I: Partitions
Acta Informatica | 1990-01-01 | Paper |
