×

Found 16 Documents (Results 1–16)

Recognizing weakly simple polygons. (English) Zbl 1387.68230

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 8, 16 p. (2016).
MSC:  68U05 52C45 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Detecting weakly simple polygons. (English) Zbl 1371.68288

Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1655-1670 (2015).
MSC:  68U05 52B11 52B55
PDFBibTeX XMLCite
Full Text: DOI arXiv

Empty-ellipse graphs. (English) Zbl 1192.52020

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 1249-1257 (2008).
MSC:  52B55 05C62 68U05
PDFBibTeX XMLCite

Walking your dog in the woods in polynomial time. (English) Zbl 1221.68101

Proceedings of the twenty-fourth annual symposium on computational geometry, SCG 2008, College Park, MD, USA, June 09–11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 101-109 (2008).
PDFBibTeX XMLCite
Full Text: DOI Link

Tightening non-simple paths and cycles on surfaces. (English) Zbl 1192.68737

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 192-201 (2006).
MSC:  68U05 05C10 52B55
PDFBibTeX XMLCite
Full Text: DOI

Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes. (English) Zbl 1046.52008

Bezdek, András (ed.), Discrete geometry. In honor of W. Kuperberg’s 60th birthday. New York, NY: Marcel Dekker (ISBN 0-8247-0968-3/hbk). Pure Appl. Math., Marcel Dekker 253, 267-278 (2003).
MSC:  52B10 52B12
PDFBibTeX XMLCite
Full Text: arXiv

Vertex-unfoldings of simplicial manifolds. (English) Zbl 1047.52009

Bezdek, András (ed.), Discrete geometry. In honor of W. Kuperberg’s 60th birthday. New York, NY: Marcel Dekker (ISBN 0-8247-0968-3/hbk). Pure Appl. Math., Marcel Dekker 253, 215-228 (2003).
MSC:  52B70
PDFBibTeX XMLCite

Optimally cutting a surface into a disk. (English) Zbl 1414.68118

Proceedings of the 18th annual symposium on computational geometry, SCG/SoCG 2002, Barcelona, Spain, June 5–7, 2002. New York, NY: Association for Computing Machinery (ACM). 244-253 (2002).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Vertex-unfoldings of simplicial manifolds. (English) Zbl 1415.52008

Proceedings of the 18th annual symposium on computational geometry, SCG/SoCG 2002, Barcelona, Spain, June 5–7, 2002. New York, NY: Association for Computing Machinery (ACM). 237-243 (2002).
MSC:  52B70
PDFBibTeX XMLCite
Full Text: DOI Link

Iterated nearest neighbors and finding minimal polytypes. (English) Zbl 0801.68162

Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 64-73 (1993).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field