#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2009

2017

- This year (3)
- Last 5 years (7)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Siu-Wing Cheng, Man-Kwun Chiu
- SODA
- 2009

We present a novel approach to estimate the dimension m of an unknown manifold M ⊂ R with positive reach from a set of point samples P ⊂ M. It works by analyzing the shape of simplices formed by point samples. Suppose that P is drawn from M according to a Poisson process with an unknown parameter λ. Let k be some fixed positive integer. When λ is large… (More)

- Jean-François Baffier, Man-Kwun Chiu, +5 authors Yushi Uno
- FUN
- 2016

This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint. The aim of the game is to play cards from 1 to n in increasing order (this has to be done independently in c different colors). Cards are drawn from a deck one by one. Drawn cards are either immediately played, discarded or stored for future use… (More)

- Siu-Wing Cheng, Man-Kwun Chiu
- SODA
- 2014

- Siu-Wing Cheng, Man-Kwun Chiu
- Discrete & Computational Geometry
- 2016

Let M be an m-dimensional smooth compact manifold embedded in R, where m is a constant known to us. Suppose that a dense set of points are sampled from M according to a Poisson process with an unknown parameter. Let p be any sample point, let % be the local feature size at p, and let %ε be the distance from p to the (n + 1)th nearest sample point for some n… (More)

- Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron
- ISAAC
- 2015

We propose an algorithm for finding a (1 + ε)-approximate shortest path through a weighted 3D simplicial complex T . The weights are integers from the range [1,W ] and the vertices have integral coordinates. Let N be the largest vertex coordinate magnitude, and let n be the number of tetrahedra in T . Let ρ be some arbitrary constant. Let κ be the size of… (More)

- Jean-François Baffier, Man-Kwun Chiu, +5 authors Yushi Uno
- Theor. Comput. Sci.
- 2017

This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint. The aim of the game is to play cards from 1 to n in increasing order (this has to be done independently in c different colors). Cards are drawn from a deck one by one. Drawn cards are either immediately played, discarded or stored for future use… (More)

- Paz Carmi, Man-Kwun Chiu, +6 authors Shakhar Smorodinsky
- WADS
- 2017

We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of n unit disks in the plane there exists a line ` such that ` intersects at most O( √ (m+ n) logn) disks and each of the halfplanes determined by ` contains at most 2n/3 unit disks from the set, where m is the number of intersecting pairs of disks.… (More)

- Man-Kwun Chiu, Matias Korman
- Symposium on Computational Geometry
- 2017

We consider the problem of digitalizing Euclidean line segments from R to Z. Christ et al. (DCG, 2012) showed how to construct a set of consistent digital segment (CDS) for d = 2: a collection of segments connecting any two points in Z2 that satisfies the natural extension of the Euclidean axioms to Z. In this paper we study the construction of CDSs in… (More)

- ‹
- 1
- ›