Mankwun Chiu

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

9 Results for: Author: Mankwun ChiuEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,856,489 records)|Limit your search to The ACM Full-Text Collection (778,916 records)

Results

Showing 1 - 9of9 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

research-article
Coloring circle arrangements: New 4-chromatic planar graphs
- Man-Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- Stefan Felsner
  Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
  ,
- Manfred Scheucher
  Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
  ,
- Felix Schröder
  Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
  ,
- Raphael Steiner
  Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
  Institute of Theoretical Computer Science, Department of Computer Science, ETH Zürich, Zürich, Switzerland
  ,
- Birgit Vogtenhuber
  Institute of Software Technology, Graz University of Technology, Graz, Austria
European Journal of Combinatorics, Volume 121, Issue C•Oct 2024 • https://doi.org/10.1016/j.ejc.2023.103839
Abstract
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most 3. Motivated by this conjecture, we study the colorability of arrangement graphs for different classes ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
A Generalization of Self-Improving Algorithms
- Kai Jin
  School of Intelligent Systems Engineering, Sun Yat-Sen University, Shen Zhen, China
  ,
- Siu-Wing Cheng
  Department of Computer Science and Engineering, HKUST, Hong Kong, China
  ,
- Man-Kwun Chiu
  Freie Universität Berlin, Berlin, Germany
  ,
- Man Ting Wong
  Department of Computer Science and Engineering, HKUST, Hong Kong, China
ACM Transactions on Algorithms, Volume 18, Issue 3•July 2022, Article No.: 29, pp 1-32 • https://doi.org/10.1145/3531227
Ailon et al. [SICOMP’11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances x₁, ... , x_n follow some unknown product distribution. That is, x_i is drawn independently from a fixed unknown distribution 𝒟_...
0Citation
201
Downloads
Metrics
Total Citations0
Total Downloads201
Last 12 Months30
Last 6 weeks4
Export Citations
Save to Binder
Get Access
research-article
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays
- Man-Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- Matias Korman
  Siemens Electronic Design Automation, Wilsonville, OR, USA
  ,
- Martin Suderland
  Faculty of Informatics, Università della Svizzera italiana, Lugano, Switzerland
  ,
- Takeshi Tokuyama
  Kwansei Gakuin University, Sanda, Japan
Discrete & Computational Geometry, Volume 68, Issue 3•Oct 2022, pp 902-944 • https://doi.org/10.1007/s00454-021-00349-6
Abstract
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $Z^{d}$ . The construction must be consistent (that is, satisfy the natural extension of the Euclidean axioms) while ... $_{}$ $^{}$ $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Snipperclips: Cutting tools into desired polygons using themselves
- Zachary Abel
  Massachusetts Institute of Technology, Cambridge, MA, USA
  ,
- Hugo Akitaya
  University of Massachusetts Lowell, USA
  ,
- Man-Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, Germany
  ,
- Erik D. Demaine
  Massachusetts Institute of Technology, Cambridge, MA, USA
  ,
- Martin L. Demaine
  Massachusetts Institute of Technology, Cambridge, MA, USA
  ,
- Adam Hesterberg
  Massachusetts Institute of Technology, Cambridge, MA, USA
  ,
- Matias Korman
  Siemens EDA (formerly Mentor Graphics), OR, USA
  ,
- Jayson Lynch
  University of Waterloo, Ontario, Canada
  ,
- André van Renssen
  University of Sydney, Sydney, Australia
  ,
- Marcel Roeloffzen
  TU Eindhoven, Eindhoven, the Netherlands
Computational Geometry: Theory and Applications, Volume 98, Issue C•Oct 2021 • https://doi.org/10.1016/j.comgeo.2021.101784
Abstract
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e., subtract its current shape from) the other tool. We ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Routing in polygonal domains
- Bahareh Banyassady
  Zuse Institute Berlin, Berlin, Germany
  ,
- Man-Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- Matias Korman
  Department of Computer Science, Tufts University, Medford, MA, USA
  ,
- Wolfgang Mulzer
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- André van Renssen
  The University of Sydney, Sydney, Australia
  ,
- Marcel Roeloffzen
  Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands
  ,
- Paul Seiferth
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- Yannik Stein
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- Birgit Vogtenhuber
  Institute of Software Technology, Graz University of Technology, Graz, Austria
  ,
- Max Willert
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
Computational Geometry: Theory and Applications, Volume 87, Issue C•Apr 2020 • https://doi.org/10.1016/j.comgeo.2019.101593
Abstract
We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a label and a routing table for each vertex of P. Then, we must be able to ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Article
Routing in Histograms
- Man-Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, 14195, Berlin, Germany
  ,
- Jonas Cleve
  Institut für Informatik, Freie Universität Berlin, 14195, Berlin, Germany
  ,
- Katharina Klost
  Institut für Informatik, Freie Universität Berlin, 14195, Berlin, Germany
  ,
- Matias Korman
  Department of Computer Science, Tufts University, Medford, MA, USA
  ,
- Wolfgang Mulzer
  Institut für Informatik, Freie Universität Berlin, 14195, Berlin, Germany
  ,
- André van Renssen
  School of Computer Science, University of Sydney, Sydney, Australia
  ,
- Marcel Roeloffzen
  Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
  ,
- Max Willert
  Institut für Informatik, Freie Universität Berlin, 14195, Berlin, Germany
WALCOM: Algorithms and Computation•March 2020, pp 43-54• https://doi.org/10.1007/978-3-030-39881-1_5
Abstract
Let P be an x-monotone orthogonal polygon with n vertices. We call P a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points p and q in ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Balanced line separators of unit disk graphs
- Paz Carmi
  Ben-Gurion University of the Negev, Beer-Sheva, Israel
  ,
- Man Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  ,
- Matthew J. Katz
  Ben-Gurion University of the Negev, Beer-Sheva, Israel
  ,
- Matias Korman
  Tufts University, Medford, MA, USA
  ,
- Yoshio Okamoto
  The University of Electro-Communications, Tokyo, Japan
  RIKEN Center for Advanced Intelligence Project, Tokyo, Japan
  ,
- André van Renssen
  University of Sydney, Sydney, Australia
  ,
- Marcel Roeloffzen
  TU Eindhoven, Eindhoven, the Netherlands
  ,
- Taichi Shiitada
  The University of Electro-Communications, Tokyo, Japan
  ,
- Shakhar Smorodinsky
  Ben-Gurion University of the Negev, Beer-Sheva, Israel
Computational Geometry: Theory and Applications, Volume 86, Issue C•Jan 2020 • https://doi.org/10.1016/j.comgeo.2019.101575
Abstract
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 ) log ⁡ n ) disks and each of the ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Implicit Manifold Reconstruction
- Siu-Wing Cheng
  Department of Computer Science and Engineering, HKUST, Hong Kong, China
  ,
- Man-Kwun Chiu
  Institut für Informatik, Freie Universität Berlin, Berlin, Germany
Discrete & Computational Geometry, Volume 62, Issue 3•Oct 2019, pp 700-742 • https://doi.org/10.1007/s00454-019-00095-w
Abstract
Let $${{\mathcal {M}}} \subset \mathbb {R}^d$$ be a compact, smooth and boundaryless manifold with dimension m and unit reach. We show how to construct a function $$\varphi :\mathbb {R}^d \rightarrow \mathbb {R}^{d-m}$$ from a uniform $$(\...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
High Dimensional Consistent Digital Segments
- Man-Kwun Chiu,
- Matias Korman
SIAM Journal on Discrete Mathematics, Volume 32, Issue 4, pp 2566-2590 • https://doi.org/10.1137/17M1136572

We consider the problem of digitalizing Euclidean line segments from $\mathbb{R}^d$ to $\mathbb{Z}^d$. Christ, Pálvölgyi, and Stojaković, [Discrete Comput. Geom., 47 (2012), pp. 691--710] showed how to construct a set of consistent digital segments (CDS) ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder

Author Profile Pages

Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples:
History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:
- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.

Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
Future Direction: The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.

A direct search interface for Author Profiles will be built.

An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.

It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.

Bibliometrics

The ACM DL is a comprehensive repository of publications from the entire field of computing.

It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.

Average citations per article = The total Citation Count divided by the total Publication Count.
Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)

ACM Author-Izer Service

Summary Description

ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.

Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.

ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.

To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.

How ACM Author-Izer Works

Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.

The Service can be applied to all the articles you have ever published with ACM.

Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.

For authors who do not have a free ACM Web Account:

Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.

For authors who have an ACM web account, but have not edited their ACM Author Profile page:

Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.

For authors who have an account and have already edited their Profile Page:

Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"

ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.

Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.

FAQ

Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
Q. What articles are eligible for ACM Author-Izer?
A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.

Q. Are there any restrictions on authors to use this service?
A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.

Q. What are the requirements to use this service?
A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.

Q. What is an ACM Author Profile Page?
A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.

Q. How do I find my Author Profile page and take ownership?
A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours

Q. Why does my photo not appear?
A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters

Q. What if I cannot find the Add Personal Information function on my author page?
A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.

Q. What happens if an author changes the location of his bibliography or moves to a new institution?
A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.

Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.

However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.

Q. What happens if the author’s bibliography lives on a page with several aliases?
A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.

Q. Why should authors use ACM Author-Izer?
A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.

Q. Does ACM Author-Izer provide benefits for authors?
A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.

Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.

Q. How does ACM Author-Izer benefit the computing community?
A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.

In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.

Q. How do authors access ACM Author-Izer?
A. See How to Use

Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.

Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner

Mankwun Chiu

Mankwun Chiu

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Results

Coloring circle arrangements: New 4-chromatic planar graphs

A Generalization of Self-Improving Algorithms

Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays

Snipperclips: Cutting tools into desired polygons using themselves

Routing in polygonal domains

Routing in Histograms

Balanced line separators of unit disk graphs

Implicit Manifold Reconstruction

High Dimensional Consistent Digital Segments