| 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 | 2023-01-18 | Paper |
| Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining | 2022-12-16 | Paper |
| On intersection searching problems involving curved objects | 2022-12-09 | Paper |
| On some geometric optimization problems in layered manufacturing | 2022-08-19 | Paper |
| Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions | 2020-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643897 | 2018-05-29 | Paper |
| Efficient algorithms for counting and reporting pairwise intersections between convex polygons | 2016-06-16 | Paper |
| A technique for adding range restrictions to generalized searching problems | 2016-06-09 | Paper |
| Linear space adaptive data structures for planar range reporting | 2016-03-01 | Paper |
| $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking | 2015-09-11 | Paper |
| Reporting and counting maximal points in a query orthogonal rectangle | 2015-02-13 | Paper |
| On reporting the \(L_1\) metric closest pair in a query rectangle | 2014-04-15 | Paper |
| Colored top-\(K\) range-aggregate queries | 2014-04-14 | Paper |
| Data structures for range-aggregate extent queries | 2014-01-22 | Paper |
| Counting Maximal Points in a Query Orthogonal Rectangle | 2013-04-12 | Paper |
| Data structures for range-aggregation over categories | 2012-08-29 | Paper |
| Range Aggregate Maximal Points in the Plane | 2012-06-08 | Paper |
| Data structures for extension violations in a query range | 2012-02-21 | Paper |
| Efficient Top-k Queries for Orthogonal Ranges | 2011-02-20 | Paper |
| EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA | 2010-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5757089 | 2007-08-24 | Paper |
| Optimal algorithms for some polygon enclosure problems for VLSI layout analysis | 2007-02-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934236 | 2000-01-17 | Paper |
| Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design | 2000-01-04 | Paper |
| On some geometric optimization problems in layered manufacturing | 1999-09-22 | Paper |
| Minimizing support structures and trapped area in two-dimensional layered manufacturing | 1999-09-22 | Paper |
| The Rectangle Enclosure and Point-Dominance Problems Revisited | 1997-10-30 | Paper |
| Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining | 1996-12-17 | Paper |
| Fast algorithms for collision and proximity problems involving moving geometric objects | 1996-12-08 | Paper |
| Algorithms for generalized halfspace range searching and other intersection searching problems | 1996-11-04 | Paper |
| Algorithms for generalized halfspace range searching and other intersection searching problems | 1996-11-04 | Paper |
| Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization | 1996-05-28 | Paper |
| Extending the quadrangle inequality to speed-up dynamic programming | 1994-05-03 | Paper |
