Siu-Wing Cheng

CoRR, 2024

A Fast Method for Lasso and Logistic Lasso.

[BibT_eX]

[DOI]

Man Ting Wong

CoRR, 2024

Solving Fréchet Distance Problems by Algebraic Geometric Methods.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Geometric Matching and Bottleneck Problems.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Shortest Journeys in Directed Temporal Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

Computational Geometry (Dagstuhl Seminar 23221).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

Geometric Assignment and Geometric Bottleneck.

[BibT_eX]

[DOI]

CoRR, 2023

Curve Simplification and Clustering under Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Approximate Nearest Neighbor for Polygonal Curves Under Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Multistage online maxmin allocation of indivisible entities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A Generalization of Self-Improving Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

Dynamic Distribution-Sensitive Point Location.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

On Non-Negative Quadratic Programming in Geometric Optimization.

[BibT_eX]

[DOI]

Man Ting Wong

CoRR, 2022

Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

Fitting a graph to one-dimensional data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Adaptive Planar Point Location.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Computational Geometry (Dagstuhl Seminar 21181).

[BibT_eX]

[DOI]

Anne Driemel

Jeff M. Phillips

Dagstuhl Reports, 2021

Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions.

[BibT_eX]

[DOI]

Man Ting Wong

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

General Max-Min Fair Allocation.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Extensions of Self-Improving Sorters.

[BibT_eX]

[DOI]

Kai Jin

Lie Yan

Algorithmica, 2020

Fitting a Graph to One-Dimensional Data.

[BibT_eX]

Taegyoung Lee

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Implicit Manifold Reconstruction.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

Computational Geometry (Dagstuhl Seminar 19181).

[BibT_eX]

[DOI]

Anne Driemel

Jeff Erickson

Dagstuhl Reports, 2019

A note on self-improving sorting with hidden partitions.

[BibT_eX]

[DOI]

Kai Jin

CoRR, 2019

Restricted Max-Min Allocation: Approximation and Integrality Gap.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Minimax Regret 1-Median Problem in Dynamic Path Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Report on AAAC 2018.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation.

[BibT_eX]

[DOI]

CoRR, 2018

Extensions of Self-Improving Sorters.

[BibT_eX]

[DOI]

Lie Yan

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Restricted Max-Min Fair Allocation.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

A Fast and Simple Surface Reconstruction Algorithm.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Finding Largest Common Point Sets.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Adaptive Point Location in Planar Convex Subdivisions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Navigating Weighted Regions with Scattered Skinny Tetrahedra.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Denoising a Point Cloud for Surface Reconstruction.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Manifold Reconstruction.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

3D Conforming Delaunay Triangulation.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

A Faster Algorithm for Computing Straight Skeletons.

[BibT_eX]

[DOI]

Liam Mencel

Antoine Vigneron

ACM Trans. Algorithms, 2016

Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9).

[BibT_eX]

[DOI]

Yoshio Okamoto

NII Shonan Meet. Rep., 2016

Tangent Estimation from Point Samples.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Minimax regret 1-sink location problem in dynamic path networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Edge Flips in Surface Meshes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Olivier Devillers

Discret. Comput. Geom., 2015

Guest Editors Foreword.

[BibT_eX]

[DOI]

Leizhen Cai

Tak Wah Lam

Algorithmica, 2015

Triangulation Refinement and Approximate Shortest Paths in Weighted Regions.

[BibT_eX]

[DOI]

Antoine Vigneron

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Piecewise linear approximation of streaming time series data with max-error guarantees.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2014

Approximate Shortest Descending Paths.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Overlap of convex polytopes under rigid motion.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Shortest paths on polyhedral surfaces and terrains.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

2013

Shape matching under rigid motion.

[BibT_eX]

[DOI]

Chi-Kit Lam

Comput. Geom., 2013

Maximum overlap of convex polytopes under translation.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Iris Reinbacher

Comput. Geom., 2013

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Delaunay Mesh Generation.

[BibT_eX]

[DOI]

Jonathan Richard Shewchuk

Chapman and Hall / CRC computer and information science series, CRC Press, ISBN: 978-1-584-88730-0, 2013

2012

Range searching on uncertain data.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Ke Yi

ACM Trans. Algorithms, 2012

Approximating the average stretch factor of geometric graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2012

Approximate Shortest Homotopic Paths in Weighted Regions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

2011

Edge flips and deforming surface meshes.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Querying Approximate Shortest Paths in Anisotropic Regions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Delaunay Refinement for Piecewise Smooth Complexes.

[BibT_eX]

[DOI]

Edgar A. Ramos

Discret. Comput. Geom., 2010

2009

Casting an Object with a Core.

[BibT_eX]

[DOI]

Algorithmica, 2009

Dimension detection via slivers.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Indexing uncertain data.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

2008

Approximate Shortest Paths in Anisotropic Regions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Provable Dimension Detection Using Principal Component Analysis.

[BibT_eX]

[DOI]

Yajun Wang

Zhuangzhi Wu

Int. J. Comput. Geom. Appl., 2008

Maintaining deforming surface meshes.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Sampling and Meshing a Surface with Guaranteed Topology and Geometry.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Delaunay Edge Flips in Dense Surface Triangulations

[BibT_eX]

[DOI]

CoRR, 2007

Motorcycle Graphs and Straight Skeletons.

[BibT_eX]

[DOI]

Antoine Vigneron

Algorithmica, 2007

A Practical Delaunay Meshing Algorithm for aLarge Class of Domains*.

[BibT_eX]

[DOI]

Joshua A. Levine

Proceedings of the 16th International Meshing Roundtable, 2007

2006

Three-Dimensional Delaunay Mesh Generation.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

On the sizes of Delaunay meshes.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Casting with Skewed Ejection Direction.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Algorithmica, 2006

Anisotropic surface meshing.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Quality Meshing of Polyhedra with Small Angles.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Curve reconstruction from noisy samples.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Manifold reconstruction from point samples.

[BibT_eX]

[DOI]

Edgar A. Ramos

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Weighted Delaunay Refinement for Polyhedra with Small Angles.

[BibT_eX]

[DOI]

Tathagata Ray

Proceedings of the 14th International Meshing Roundtable, 2005

Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

Planar Straight Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Competitive facility location: the Voronoi game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

The reflex-free hull.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2004

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

Hierarchy of surface models and irreducible triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2004

2003

Quality Meshing with Weighted Delaunay Refinement.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Volume and Surface Triangulations - Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

Quadtree, ray shooting and approximate minimum weight Steiner triangulation.

[BibT_eX]

[DOI]

Kam-Hing Lee

Comput. Geom., 2002

Separating an object from its cast.

[BibT_eX]

[DOI]

Comput. Aided Des., 2002

Hierarchy of Surface Models and Irreducible Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

On beta-skeleton as a subgraph of the minimum weight triangulation.

[BibT_eX]

[DOI]

Yin-Feng Xu

Theor. Comput. Sci., 2001

Approximation Algorithm for Multiple-Tool Milling.

[BibT_eX]

[DOI]

Sunil Arya

David M. Mount

Int. J. Comput. Geom. Appl., 2001

Design and analysis of planar shape deformation.

[BibT_eX]

[DOI]

Comput. Geom., 2001

Competitive Facility Location along a Highway.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

The Steiner tree problem for terminals on the boundary of a rectilinear polygon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Sliver exudation.

[BibT_eX]

[DOI]

J. ACM, 2000

LMT-skeleton heuristics for several new classes of optimal triangulations.

[BibT_eX]

[DOI]

Yang Dai

Naoki Katoh

Comput. Geom., 2000

Efficient Expected-Case Algorithms for Planar Point Location.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Selecting Independent Chains on a Triangulated 2-Manifold.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Approximate Minimum Weight Steiner Triangulation in Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Improved constructions of Delaunay based contour surfaces.

[BibT_eX]

[DOI]

Proceedings of the Fifth ACM Symposium on Solid Modeling and Applications, 1999

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Casting with skewed ejection direction revisited.

[BibT_eX]

[DOI]

Hee-Kap Ahn

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Minimum Dominating Sets of Intervals on Lines.

[BibT_eX]

[DOI]

Michael Kaminski

Shmuel Zaks

Algorithmica, 1998

Quadtree Decomposition, Steiner Triangulation, and Ray Shooting.

[BibT_eX]

[DOI]

Kam-Hing Lee

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Approximation Algorithms for Multiple-Tool Miling.

[BibT_eX]

[DOI]

Sunil Arya

David M. Mount

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1996

Widest Empty L-Shaped Corridor.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Triangulations Intersect Nicely.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

Isomorphism Testing and Display of Symmetries in Dynamic Trees.

[BibT_eX]

[DOI]

Moon-Pun Ng

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A Study of the LMT-Skeleton.

[BibT_eX]

[DOI]

Naoki Katoh

Manabu Sugai

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation.

[BibT_eX]

[DOI]

Yin-Feng Xu

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets.

[BibT_eX]

[DOI]

Chi-Keung Tang

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Constrained Independence System and Triangulations of Planar Point Sets.

[BibT_eX]

[DOI]

Yin-Feng Xu

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Minimum Dominating Sets of Intervals on Lines (Extended Abstract).

[BibT_eX]

[DOI]

Michael Kaminski

Shmuel Zaks

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

The role of long and short paths in circuit performance optimization.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

Modifications of Competitive Group Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Widest Empty Corridor with Multiple Links and Right-angle Turns.

[BibT_eX]

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Optimal Joining of Compacted Cells.

[BibT_eX]

[DOI]

Sartaj Sahni

IEEE Trans. Computers, 1993

Single Jog Minimum Area Joining of Compacted Cells.

[BibT_eX]

[DOI]

Yeow Meng Chee

Inf. Process. Lett., 1993

Optimal Rectilinear Steiner Tree for Extremal Point Sets.

[BibT_eX]

[DOI]

Ching-Ting Wu

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

A Path Sensitization Approach to Area Reduction.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, 1993

Performance Oriented Rectilinear Steiner Trees.

[BibT_eX]

[DOI]

Ching-Ting Wu

Proceedings of the 30th Design Automation Conference. Dallas, 1993

1992

New Results on Dynamic Planar Point Location.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1992

Algorithms for Ray-Shooting and Intersection Searching.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Circuit Enhancement by Eliminating Long False Paths.

[BibT_eX]

[DOI]

Hsi-Chuan Chen

David Hung-Chang Du

Proceedings of the 29th Design Automation Conference, 1992

1991

Efficient Maintenance of the Union of Intervals on a Line, with Applications.

[BibT_eX]

[DOI]

J. Algorithms, 1991

Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Efficient Dynamic Algorithms for Some Geometric Intersection Problems.

[BibT_eX]

[DOI]