| 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 |
Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
Theoretical Computer Science | 2020-03-12 | Paper |
scientific article; zbMATH DE number 6876123 (Why is no real title available?)
| 2018-05-29 | 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 |
Linear space adaptive data structures for planar range reporting
Information Processing Letters | 2016-03-01 | Paper |
$$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Reporting and counting maximal points in a query orthogonal rectangle
Journal of Discrete Algorithms | 2015-02-13 | Paper |
On reporting the \(L_1\) metric closest pair in a query rectangle
Information Processing Letters | 2014-04-15 | Paper |
Colored top-\(K\) range-aggregate queries
Information Processing Letters | 2014-04-14 | Paper |
Data structures for range-aggregate extent queries
Computational Geometry | 2014-01-22 | Paper |
Counting Maximal Points in a Query Orthogonal Rectangle
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Data structures for range-aggregation over categories
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Range aggregate maximal points in the plane
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Data structures for extension violations in a query range
JMMA. Journal of Mathematical Modelling and Algorithms | 2012-02-21 | 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 |
Range-aggregate query problems involving geometric aggregation operations
| 2007-08-24 | Paper |
Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
JMMA. Journal of Mathematical Modelling and Algorithms | 2007-02-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | 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 |
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 |
Extending the quadrangle inequality to speed-up dynamic programming
Information Processing Letters | 1994-05-03 | Paper |
