SiuWing Cheng
According to our database^{1},
SiuWing Cheng
authored at least 107 papers
between 1990 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Report on AAAC 2018.
Bulletin of the EATCS, 2018
Extensions of SelfImproving Sorters.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
Restricted MaxMin Fair Allocation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Finding Largest Common Point Sets.
Int. J. Comput. Geometry Appl., 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
Theory and Applications of Geometric Optimization (NII Shonan Meeting 20169).
NII Shonan Meet. Rep., 2016
Tangent Estimation from Point Samples.
Discrete & Computational Geometry, 2016
Minimax Regret 1Median 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 1sink 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
Guest Editors Foreword.
Algorithmica, 2015
Triangulation Refinement and Approximate Shortest Paths in Weighted Regions.
Proceedings of the TwentySixth Annual ACMSIAM 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 maxerror guarantees.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015
2014
Shortest paths on polyhedral surfaces and terrains.
Proceedings of the Symposium on Theory of Computing, 2014
Implicit Manifold Reconstruction.
Proceedings of the TwentyFifth Annual ACMSIAM 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
Minimax Regret 1Sink Location Problems in Dynamic Path Networks.
Proceedings of the Theory and Applications of Models of Computation, 2013
Approximate Shortest Descending Paths.
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Delaunay Mesh Generation.
Chapman and Hall / CRC computer and information science series, CRC Press, ISBN: 9781584887300, 2013
2012
Range searching on uncertain data.
ACM Trans. Algorithms, 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
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
Dimension detection via slivers.
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
Indexing uncertain data.
Proceedings of the TwentyEigth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2009
2008
Maintaining deforming surface meshes.
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
2007
Approximate shortest paths in anisotropic regions.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Delaunay refinement for piecewise smooth complexes.
Proceedings of the Eighteenth Annual ACMSIAM 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
ThreeDimensional Delaunay Mesh Generation.
Discrete & Computational Geometry, 2006
On the sizes of Delaunay meshes.
Comput. Geom., 2006
Anisotropic surface meshing.
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
2005
Quality Meshing of Polyhedra with Small Angles.
Int. J. Comput. Geometry Appl., 2005
Manifold reconstruction from point samples.
Proceedings of the Sixteenth Annual ACMSIAM 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
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
Graded conforming Delaunay tetrahedralization with bounded radiusedge ratio.
Proceedings of the Fourteenth Annual ACMSIAM 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
Motorcycle graphs and straight skeletons.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Quality meshing with weighted Delaunay refinement.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Hierarchy of Surface Models and Irreducible Triangulation.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
On betaskeleton as a subgraph of the minimum weight triangulation.
Theor. Comput. Sci., 2001
Approximation Algorithm for MultipleTool Milling.
Int. J. Comput. Geometry Appl., 2001
Competitive Facility Location along a Highway.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
The reflexfree 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
LMTskeleton heuristics for several new classes of optimal triangulations.
Comput. Geom., 2000
Efficient ExpectedCase Algorithms for Planar Point Location.
Proceedings of the Algorithm Theory, 2000
Selecting Independent Chains on a Triangulated 2Manifold.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
1999
Approximate Minimum Weight Steiner Triangulation in Three Dimensions.
Proceedings of the Tenth Annual ACMSIAM 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 MultipleTool 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 LShaped 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 ACMSIAM Symposium on Discrete Algorithms, 1996
A Study of the LMTSkeleton.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
Approaching the Largest betaSkeleton 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
Modifications of Competitive Group Testing.
SIAM J. Comput., 1994
Widest Empty Corridor with Multiple Links and Rightangle 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
Algorithms for RayShooting 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
Spaceefficient Rayshooting and Intersection Searching: Algorithms, Dynamization, and Applications.
Proceedings of the Second Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1991
1990
Efficient Dynamic Algorithms for Some Geometric Intersection Problems.
Inf. Process. Lett., 1990
Efficient Distributed Algorithms for SingleSource 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 ACMSIAM Symposium on Discrete Algorithms, 1990
New Results on Dynamic Planar Point Location
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990