{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreibuuzicr6tvn36qzqlslryk7v5tqdmsa5rx4jxgl2gsyuzxmam7ie",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mgw2ps6e6f62"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.11851v1",
  "publishedAt": "2026-03-13T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Romain Negro",
    "Jacques-Olivier Lachaud"
  ],
  "textContent": "**Authors:** Romain Negro, Jacques-Olivier Lachaud\n\nComputing visibility on a geometric object requires heavy computations since it requires to identify pairs of points that are visible to each other, i.e. there is a straight segment joining them that stays in the close vicinity of the object boundary. We propose to exploit a specic representation of digital sets based on lists of integral intervals in order to compute eciently the complete visibility graph between lattice points of the digital shape. As a quite direct application, we show then how we can use visibility to estimate the normal vector eld of a digital shape in an accurate and convergent manner while staying aware of the salient and sharp features of the shape.",
  "title": "Fast and exact visibility on digitized shapes and application to saliency-aware normal estimation"
}