<--- Back to Details
First PageDocument Content
Triangulation / Euclidean plane geometry / Computational geometry / Beta skeleton / Delaunay triangulation / Geometric graph theory / Gabriel graph / Graph / Matching / Graph theory / Mathematics / Geometry
Date: 2009-09-02 14:34:07
Triangulation
Euclidean plane geometry
Computational geometry
Beta skeleton
Delaunay triangulation
Geometric graph theory
Gabriel graph
Graph
Matching
Graph theory
Mathematics
Geometry

CCCG 2009, Vancouver, BC, August 17–19, 2009 Relaxed Gabriel Graphs Prosenjit Bose∗ Jean Cardinal†

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 186,61 KB

Share Document on Facebook

Similar Documents

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin  DIAMANT Symposium – November 2012

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

DocID: 1rs14 - View Document

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald  Roger Wattenhofer

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

DocID: 1rrUb - View Document

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

DocID: 1rlxP - View Document

Contractibility and Self-Intersections of Curves on Surfaces David de Laat  Bachelor Thesis in Mathematics

Contractibility and Self-Intersections of Curves on Surfaces David de Laat Bachelor Thesis in Mathematics

DocID: 1r3nI - View Document

COCOMPACTLY CUBULATED GRAPH MANIFOLDS MARK F. HAGEN∗ AND PIOTR PRZYTYCKI† Abstract. Let M be a graph manifold. We show that π1 M is the fundamental group of a compact nonpositively curved cube complex if and only if

COCOMPACTLY CUBULATED GRAPH MANIFOLDS MARK F. HAGEN∗ AND PIOTR PRZYTYCKI† Abstract. Let M be a graph manifold. We show that π1 M is the fundamental group of a compact nonpositively curved cube complex if and only if

DocID: 1r06N - View Document