Name
Abstract | ||
|---|---|---|
In this paper, we present some results concerning the median points of a discrete set according to a distance defined by means of two directions p and q. We describe a local characterization of the median points and show how these points can be determined from the projections of the discrete set along directions p and q. We prove that the discrete sets having some connectivity properties have at most four median points according to a linear distance, and if there are four median points they form a parallelogram. Finally, we show that the 4-connected sets which are convex along the diagonal directions contain their median points along these directions. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/s004540010018 | Discrete and Computational Geometry |
Keywords | Field | DocType |
connected set,discrete set,linear distance,projection,median point,con- vexity. | Diagonal,Discrete mathematics,Combinatorics,Convexity,Parallelogram,Regular polygon,Median cut,Connected space,Mathematics,Median | Journal |
Volume | Issue | ISSN |
23 | 4 | 1432-0444 |
Citations | PageRank | References |
7 | 0.75 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Daurat | 1 | 112 | 14.08 |
| Alberto Del Lungo | 2 | 376 | 44.84 |
| Maurice Nivat | 3 | 1261 | 277.74 |