Abstract | ||
---|---|---|
For a given planar point set P , consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1016/S0925-7721(01)00023-2 | Comput. Geom. |
Keywords | Field | DocType |
convex quadrilaterals,planar point set,disjoint convex quadrilateral,disjoint partition,discrete geometry | Orthogonal convex hull,Absolutely convex set,Discrete mathematics,Combinatorics,Convex set,Convex hull,Subderivative,Convex polytope,Proper convex function,Convex analysis,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 3 | Computational Geometry: Theory and Applications |
Citations | PageRank | References |
19 | 1.60 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kiyoshi Hosono | 1 | 60 | 11.01 |
Masatsugu Urabe | 2 | 153 | 25.87 |