| Publication | Date of Publication | Type |
|---|
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
| 2024-06-21 | Paper |
Further results on generalized intersection searching problems: Counting, reporting, and dynamization
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
Lecture Notes in Computer Science | 2022-12-16 | Paper |
On intersection searching problems involving curved objects
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
On some geometric optimization problems in layered manufacturing
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Searching for the closest-pair in a query translate
| 2022-07-18 | Paper |
New bounds for range closest-pair problems
Discrete & Computational Geometry | 2022-06-03 | Paper |
Searching for the closest-pair in a query translate
| 2021-03-17 | Paper |
Approximate range closest-pair queries
Computational Geometry | 2020-10-23 | Paper |
New bounds for range closest-pair problems
| 2020-08-18 | Paper |
The most-likely skyline problem for stochastic points
Computational Geometry | 2020-03-23 | Paper |
On the expected diameter, width, and complexity of a stochastic convex hull
Computational Geometry | 2019-10-25 | Paper |
On the separability of stochastic geometric objects, with applications
Computational Geometry | 2018-10-31 | Paper |
scientific article; zbMATH DE number 6876123 (Why is no real title available?)
| 2018-05-29 | Paper |
On the separability of stochastic geometric objects, with applications
| 2018-01-30 | Paper |
On the expected diameter, width, and complexity of a stochastic convex-hull
Lecture Notes in Computer Science | 2017-09-22 | Paper |
On the arrangement of stochastic lines in \(\mathbb{R}^2\)
Journal of Discrete Algorithms | 2017-07-13 | Paper |
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
Information Processing Letters | 2016-06-16 | Paper |
A technique for adding range restrictions to generalized searching problems
Information Processing Letters | 2016-06-09 | Paper |
Range search on tuples of points
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Data structures for range-aggregate extent queries
Computational Geometry | 2014-01-22 | Paper |
Geometric algorithms for layered manufacturing
| 2013-04-15 | Paper |
Efficient top-\(k\) queries for orthogonal ranges
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Efficient non-intersection queries on aggregated geometric data
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
A memetic algorithm to schedule planned maintenance for the national grid
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
scientific article; zbMATH DE number 2089993 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 1854301 (Why is no real title available?)
| 2003-05-01 | Paper |
A decomposition-based approach to layered manufacturing
Computational Geometry | 2003-03-10 | Paper |
scientific article; zbMATH DE number 1830751 (Why is no real title available?)
| 2002-11-18 | Paper |
Computing An Optimal Hatching Direction In Layered Manufacturing
International Journal of Computer Mathematics | 2002-09-18 | Paper |
scientific article; zbMATH DE number 1728315 (Why is no real title available?)
| 2002-04-15 | Paper |
ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1389816 (Why is no real title available?)
| 2000-01-17 | Paper |
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
Computational Geometry | 2000-01-04 | Paper |
On some geometric optimization problems in layered manufacturing
Computational Geometry | 1999-09-22 | Paper |
Minimizing support structures and trapped area in two-dimensional layered manufacturing
Computational Geometry | 1999-09-22 | Paper |
scientific article; zbMATH DE number 1182940 (Why is no real title available?)
| 1999-03-02 | Paper |
The Rectangle Enclosure and Point-Dominance Problems Revisited
International Journal of Computational Geometry & Applications | 1997-10-30 | Paper |
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining
CAD. Computer-Aided Design | 1996-12-17 | Paper |
Fast algorithms for collision and proximity problems involving moving geometric objects
Computational Geometry | 1996-12-08 | Paper |
Algorithms for generalized halfspace range searching and other intersection searching problems
Computational Geometry | 1996-11-04 | Paper |
Algorithms for generalized halfspace range searching and other intersection searching problems
Computational Geometry | 1996-11-04 | Paper |
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
Journal of Algorithms | 1996-05-28 | Paper |
ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE
International Journal of Computational Geometry & Applications | 1995-01-22 | Paper |
scientific article; zbMATH DE number 432752 (Why is no real title available?)
| 1994-09-20 | Paper |
scientific article; zbMATH DE number 432800 (Why is no real title available?)
| 1993-10-20 | Paper |
GENERALIZED INTERSECTION SEARCHING PROBLEMS
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
Algorithms for ray-shooting and intersection searching
Journal of Algorithms | 1993-01-12 | Paper |
New Results on Dynamic Planar Point Location
SIAM Journal on Computing | 1992-12-06 | Paper |
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
Mathematical Systems Theory | 1992-09-26 | Paper |
On the dynamic maintenance of maximal points in the plane
Information Processing Letters | 1992-06-28 | Paper |
Efficient maintenance of the union of intervals on a line, with applications
Journal of Algorithms | 1991-01-01 | Paper |
Space-Efficient Message Routing inc-Decomposable Networks
SIAM Journal on Computing | 1990-01-01 | Paper |
Efficient dynamic algorithms for some geometric intersection problems
Information Processing Letters | 1990-01-01 | Paper |
Efficient Message Routing in Planar Networks
SIAM Journal on Computing | 1989-01-01 | Paper |
Designing networks with compact routing tables
Algorithmica | 1988-01-01 | Paper |
Space-efficient and fault-tolerant message routing in outerplanar networks
IEEE Transactions on Computers | 1988-01-01 | Paper |
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1983-01-01 | Paper |
