Two-Convex Polygons∗ O. Aichholzer† F. Aurenhammer‡ F. Hurtado§

Source URL: www.igi.tugraz.at

between two crossing convex polygons,” Computing, vol. 32, 1984, ppTo85a] Toussaint, G. T., ed., Computational Geometry, North-Holland, To85b]

Source URL: www-cgrl.cs.mcgill.ca

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons Tetsuo Asano 1 Wolfgang Mulzer 2 Yajun Wang 3

Source URL: page.mi.fu-berlin.de

C:/Documents and Settings/mishaq01/Desktop/Mashhood/Conference Papers/COCOON 2009/camera ready/cocoon101a.dvi

Source URL: www.eecs.tufts.edu

• Graph theory
• Mathematics
• Graph operations
• Polygons
• Planar graphs
• Graph connectivity
• Dual graph
• Edge
• Graph
• Vertex
• Ear decomposition
• Bridge

The SUMO Speaker Series for Undergraduates Thursday, Novenber 13th 4:15-5:05, room 380C (Food Provided) Polygons, polyhedra and scissors congruence

Source URL: sumo.stanford.edu

HOLESINTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other polygons Hx, . .

Source URL: www.cs.smith.edu

Counting Convex Polygons in Planar Point Sets Joseph S. B. Mitchell a;1

Source URL: page.mi.fu-berlin.de

Shooting Permanent Rays among Disjoint Polygons in the Plane Mashhood Ishaque∗ Bettina Speckmann† Csaba D. T´oth‡

Source URL: www.eecs.tufts.edu

• Polygons
• Convex geometry
• Euclidean plane geometry
• Convex analysis
• Computational geometry
• Simple polygon
• Polygon
• Pseudotriangle
• Star polygon
• Binary space partitioning
• Face
• Convex polygon

B 4. References 1 Bhattacharya B K, ElGindy H. A new linear convex hull algorithm for simple polygons. IEEE Transactions on Information

Source URL: cgm.cs.mcgill.ca

Geometrically and Topologically Unstructured Polygons for Dynamic Cohesive Fracture Daniel W. Spring, Sofie E. Leon and Glaucio H. Paulino University of Illinois at Urbana-Champaign Motivation Brittle and quasi‐britt

Source URL: paulino.ce.gatech.edu