<--- Back to Details
First PageDocument Content
Euclidean plane geometry / Polygons / Analysis of algorithms / Matching / Vertex / Randomized algorithm / Connectivity / Star polygon / Simple polygon / Theoretical computer science / Geometry / Mathematics
Date: 2010-09-15 10:13:15
Euclidean plane geometry
Polygons
Analysis of algorithms
Matching
Vertex
Randomized algorithm
Connectivity
Star polygon
Simple polygon
Theoretical computer science
Geometry
Mathematics

CCCG 2010, Winnipeg MB, August 9–11, 2010 k-Star-shaped Polygons∗ William Evans† Abstract

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 187,68 KB

Share Document on Facebook

Similar Documents

The hamburger theorem Mikio Kano and Jan Kynˇcl EPFL Problem: Given n red and n blue points in the plane in general position, draw n

The hamburger theorem Mikio Kano and Jan Kynˇcl EPFL Problem: Given n red and n blue points in the plane in general position, draw n

DocID: 1rrZJ - View Document

A THEORY OF THE CARTOGRAPHIC LINE  Thomas K. Peucker Simon Fraser University

A THEORY OF THE CARTOGRAPHIC LINE Thomas K. Peucker Simon Fraser University

DocID: 1rdlr - View Document

Illinois Geometry Lab  Apollonian Circle Packing Density Author: Joseph Vandehey

Illinois Geometry Lab Apollonian Circle Packing Density Author: Joseph Vandehey

DocID: 1rarG - View Document

Raster-Vector Conversion Methods for Automated Cartography With Applications in Polygon Maps and Feature Analysis Shin-yi Hsu Department of Geography SUNY-Binghamton Binghamton, NY 13901

Raster-Vector Conversion Methods for Automated Cartography With Applications in Polygon Maps and Feature Analysis Shin-yi Hsu Department of Geography SUNY-Binghamton Binghamton, NY 13901

DocID: 1r8dq - View Document