|
|||||
|
|
Counting Carambolas |
|
| Authors: | Adrian Dumitrescu Maarten Löffler André Schulz Csaba D Tóth |
| Institution: | 1.Department of Computer Science,University of Wisconsin-Milwaukee,Milwaukee,USA;2.Department of Computing and Information Sciences,Utrecht University,Utrecht,The Netherlands;3.LG Theoretische Informatik,FernUniversit?t Hagen,Hagen,Germany;4.Department of Mathematics,California State University Northridge,Los Angeles,USA;5.Department of Computer Science,Tufts University,Medford,USA |
| Abstract: | We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of n points in the plane. Configurations of interest include convex polygons, star-shaped polygons and monotone paths. We also consider related problems for directed planar straight-line graphs. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |