Siu-Wing Cheng

According to our database1, Siu-Wing Cheng authored at least 137 papers between 1990 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Minimax Regret 1-Median Problem in Dynamic Path Networks.
Theory Comput. Syst., 2018

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

Restricted Max-Min Fair Allocation.
CoRR, 2018

Restricted Max-Min Fair Allocation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
A Fast and Simple Surface Reconstruction Algorithm.
ACM Trans. Algorithms, 2017

Finding Largest Common Point Sets.
Int. J. Comput. Geometry Appl., 2017

Adaptive Point Location in Planar Convex Subdivisions.
Int. J. Comput. Geometry Appl., 2017

Navigating Weighted Regions with Scattered Skinny Tetrahedra.
Int. J. Comput. Geometry Appl., 2017

Denoising a Point Cloud for Surface Reconstruction.
CoRR, 2017

Adaptive Planar Point Location.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Manifold Reconstruction.
Encyclopedia of Algorithms, 2016

3D Conforming Delaunay Triangulation.
Encyclopedia of Algorithms, 2016

A Faster Algorithm for Computing Straight Skeletons.
ACM Trans. Algorithms, 2016

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

Tangent Estimation from Point Samples.
Discrete & Computational Geometry, 2016

Minimax Regret 1-Median Problem in Dynamic Path Networks.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Minimax regret 1-sink location problem in dynamic path networks.
Theor. Comput. Sci., 2015

Guest Editors' Foreword.
JoCG, 2015

Edge Flips in Surface Meshes.
Discrete & Computational Geometry, 2015

Guest Editors' Foreword.
Discrete & Computational Geometry, 2015

Minimax Regret 1-Median Problem in Dynamic Path Networks.
CoRR, 2015

Guest Editors Foreword.
Algorithmica, 2015

Triangulation Refinement and Approximate Shortest Paths in Weighted Regions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Adaptive Point Location in Planar Convex Subdivisions.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Navigating Weighted Regions with Scattered Skinny Tetrahedra.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Piecewise linear approximation of streaming time series data with max-error guarantees.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2014
Approximate Shortest Descending Paths.
SIAM J. Comput., 2014

A Faster Algorithm for Computing Straight Skeletons.
CoRR, 2014

Overlap of convex polytopes under rigid motion.
Comput. Geom., 2014

Shortest paths on polyhedral surfaces and terrains.
Proceedings of the Symposium on Theory of Computing, 2014

Implicit Manifold Reconstruction.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A Faster Algorithm for Computing Straight Skeletons.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Shape matching under rigid motion.
Comput. Geom., 2013

Maximum overlap of convex polytopes under translation.
Comput. Geom., 2013

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks.
Proceedings of the Theory and Applications of Models of Computation, 2013

Approximate Shortest Descending Paths.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

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

2012
Range searching on uncertain data.
ACM Trans. Algorithms, 2012

Approximating the average stretch factor of geometric graphs.
JoCG, 2012

Approximate Shortest Homotopic Paths in Weighted Regions.
Int. J. Comput. Geometry Appl., 2012

Overlap of Convex Polytopes under Rigid Motion.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

A fast and simple surface reconstruction algorithm.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Edge flips and deforming surface meshes.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Querying Approximate Shortest Paths in Anisotropic Regions.
SIAM J. Comput., 2010

Delaunay Refinement for Piecewise Smooth Complexes.
Discrete & Computational Geometry, 2010

Approximating the Average Stretch Factor of Geometric Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Approximate Shortest Homotopic Paths in Weighted Regions.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Maximum Overlap of Convex Polytopes under Translation.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Casting an Object with a Core.
Algorithmica, 2009

Dimension detection via slivers.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

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

2008
Approximate Shortest Paths in Anisotropic Regions.
SIAM J. Comput., 2008

Provable Dimension Detection Using Principal Component Analysis.
Int. J. Comput. Geometry Appl., 2008

Maintaining deforming surface meshes.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Sampling and Meshing a Surface with Guaranteed Topology and Geometry.
SIAM J. Comput., 2007

Delaunay Edge Flips in Dense Surface Triangulations
CoRR, 2007

Motorcycle Graphs and Straight Skeletons.
Algorithmica, 2007

Approximate shortest paths in anisotropic regions.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Delaunay refinement for piecewise smooth complexes.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A Practical Delaunay Meshing Algorithm for aLarge Class of Domains*.
Proceedings of the 16th International Meshing Roundtable, 2007

Querying approximate shortest paths in anisotropic regions.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Three-Dimensional Delaunay Mesh Generation.
Discrete & Computational Geometry, 2006

On the sizes of Delaunay meshes.
Comput. Geom., 2006

Casting with Skewed Ejection Direction.
Algorithmica, 2006

Anisotropic surface meshing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Quality Meshing of Polyhedra with Small Angles.
Int. J. Comput. Geometry Appl., 2005

Curve reconstruction from noisy samples.
Comput. Geom., 2005

Manifold reconstruction from point samples.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Casting an Object with a Core.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Weighted Delaunay Refinement for Polyhedra with Small Angles.
Proceedings of the 14th International Meshing Roundtable, 2005

Provable dimension detection using principal component analysis.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Planar Straight Line Graphs.
Proceedings of the Handbook of Data Structures and Applications., 2004

Competitive facility location: the Voronoi game.
Theor. Comput. Sci., 2004

The reflex-free hull.
Int. J. Comput. Geometry Appl., 2004

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.
Discrete & Computational Geometry, 2004

Hierarchy of surface models and irreducible triangulations.
Comput. Geom., 2004

Quality meshing for polyhedra with small angles.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Sampling and meshing a surface with guaranteed topology and geometry.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Quality Meshing with Weighted Delaunay Refinement.
SIAM J. Comput., 2003

Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Curve reconstruction from noisy samples.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Volume and Surface Triangulations - Preface.
Int. J. Found. Comput. Sci., 2002

Quadtree, ray shooting and approximate minimum weight Steiner triangulation.
Comput. Geom., 2002

Separating an object from its cast.
Computer-Aided Design, 2002

Motorcycle graphs and straight skeletons.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Quality meshing with weighted Delaunay refinement.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Hierarchy of Surface Models and Irreducible Triangulation.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
On beta-skeleton as a subgraph of the minimum weight triangulation.
Theor. Comput. Sci., 2001

Approximation Algorithm for Multiple-Tool Milling.
Int. J. Comput. Geometry Appl., 2001

Design and analysis of planar shape deformation.
Comput. Geom., 2001

Competitive Facility Location along a Highway.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

The reflex-free hull.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
The Steiner tree problem for terminals on the boundary of a rectilinear polygon.
Theor. Comput. Sci., 2000

Sliver exudation.
J. ACM, 2000

LMT-skeleton heuristics for several new classes of optimal triangulations.
Comput. Geom., 2000

Efficient Expected-Case Algorithms for Planar Point Location.
Proceedings of the Algorithm Theory, 2000

Selecting Independent Chains on a Triangulated 2-Manifold.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Approximate Minimum Weight Steiner Triangulation in Three Dimensions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Improved constructions of Delaunay based contour surfaces.
Proceedings of the Fifth ACM Symposium on Solid Modeling and Applications, 1999

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Sliver Exudation.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Casting with skewed ejection direction revisited.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Minimum Dominating Sets of Intervals on Lines.
Algorithmica, 1998

Quadtree Decomposition, Steiner Triangulation, and Ray Shooting.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Casting with Skewed Ejection Direction.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Design and Analysis of Planar Shape Deformation.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Approximation Algorithms for Multiple-Tool Miling.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Separating an Object from its Cast.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Widest Empty L-Shaped Corridor.
Inf. Process. Lett., 1996

Triangulations Intersect Nicely.
Discrete & Computational Geometry, 1996

Isomorphism Testing and Display of Symmetries in Dynamic Trees.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A Study of the LMT-Skeleton.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Constrained Independence System and Triangulations of Planar Point Sets.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Minimum Dominating Sets of Intervals on Lines (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
The role of long and short paths in circuit performance optimization.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1994

Modifications of Competitive Group Testing.
SIAM J. Comput., 1994

Widest Empty Corridor with Multiple Links and Right-angle Turns.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Optimal Joining of Compacted Cells.
IEEE Trans. Computers, 1993

Single Jog Minimum Area Joining of Compacted Cells.
Inf. Process. Lett., 1993

Optimal Rectilinear Steiner Tree for Extremal Point Sets.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

A Path Sensitization Approach to Area Reduction.
Proceedings of the Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, 1993

Performance Oriented Rectilinear Steiner Trees.
Proceedings of the 30th Design Automation Conference. Dallas, 1993

1992
New Results on Dynamic Planar Point Location.
SIAM J. Comput., 1992

Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks.
Mathematical Systems Theory, 1992

Algorithms for Ray-Shooting and Intersection Searching.
J. Algorithms, 1992

The Role of Long and Short Paths in Circuit Performance Optimization.
Proceedings of the 29th Design Automation Conference, 1992

Circuit Enhancement by Eliminating Long False Paths.
Proceedings of the 29th Design Automation Conference, 1992

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

Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Efficient Dynamic Algorithms for Some Geometric Intersection Problems.
Inf. Process. Lett., 1990

Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Efficient Maintenance of the Union Intervals on a Line, with Applications.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

New Results on Dynamic Planar Point Location
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990


  Loading...