The following pages link to Siu-Wing Cheng (Q331367):
Displaying 50 items.
- Tangent estimation from point samples (Q331369) (← links)
- Overlap of convex polytopes under rigid motion (Q390361) (← links)
- Widest empty L-shaped corridor (Q671259) (← links)
- Single jog minimum area joining of compacted cells (Q689614) (← links)
- Design and analysis of planar shape deformation (Q699976) (← links)
- Hierarchical decompositions and circular ray shooting in simple polygons (Q705130) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- Delaunay refinement for piecewise smooth complexes (Q848856) (← links)
- Motorcycle graphs and straight skeletons (Q870459) (← links)
- (Q918701) (redirect page) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Casting an object with a core (Q1024213) (← links)
- Hierarchy of surface models and irreducible triangulations. (Q1428114) (← links)
- (Q1566724) (redirect page) (← links)
- The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
- Curve reconstruction from noisy samples (Q1775779) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation (Q1862115) (← links)
- Competitive facility location: the Voronoi game (Q1884986) (← links)
- Maximum overlap of convex polytopes under translation (Q1941219) (← links)
- Shape matching under rigid motion (Q1947970) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- Extensions of self-improving sorters (Q2285051) (← links)
- Implicit manifold reconstruction (Q2324634) (← links)
- Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
- Edge flips in surface meshes (Q2354677) (← links)
- On the sizes of Delaunay meshes (Q2489538) (← links)
- Casting with skewed ejection direction (Q2498406) (← links)
- Three-dimensional Delaunay mesh generation (Q2509091) (← links)
- Fitting a graph to one-dimensional data (Q2663044) (← links)
- Multistage online maxmin allocation of indivisible entities (Q2676469) (← links)
- General max-min fair allocation (Q2695275) (← links)
- (Q2721994) (← links)
- A fast and simple surface reconstruction algorithm (Q2874567) (← links)
- A Faster Algorithm for Computing Straight Skeletons (Q2921412) (← links)
- (Q2921773) (← links)
- (Q2934663) (← links)
- (Q2934704) (← links)
- Sliver exudation (Q2946996) (← links)
- Deforming Surface Meshes (Q2948914) (← links)
- Overlap of Convex Polytopes under Rigid Motion (Q2957524) (← links)
- Approximating the average stretch factor of geometric graphs (Q2968089) (← links)
- Querying Approximate Shortest Paths in Anisotropic Regions (Q3053153) (← links)
- Approximating the Average Stretch Factor of Geometric Graphs (Q3060719) (← links)
- Maximum Overlap of Convex Polytopes under Translation (Q3060764) (← links)
- Approximate Shortest Homotopic Paths in Weighted Regions (Q3060765) (← links)
- Delaunay Mesh Generation (Q3065883) (← links)
- (Q3132899) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
