{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreibfpo43geqdnxd2i7sfiqfnqzll6ywnqij7qp37ivkeoijotzehnq",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mhhp4aby2ww2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.18812v1",
  "publishedAt": "2026-03-20T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Oswin Aichholzer",
    "Joseph Dorfer",
    "Sándor P. Fekete",
    "Phillip Keldenich",
    "Peter Kramer",
    "Stefan Schirra"
  ],
  "textContent": "**Authors:** Oswin Aichholzer, Joseph Dorfer, Sándor P. Fekete, Phillip Keldenich, Peter Kramer, Stefan Schirra\n\nWe give an overview of the 2026 Computational Geometry Challenge targeting the problem of finding a Central Triangulation under Parallel Flip Operations in triangulations of point sets. A flip is the parallel exchange of a set of edges in a triangulation with opposing diagonals of the convex quadrilaterals containing them. The challenge objective was, given a set of triangulations of a fixed point set, to determine a central triangulation with respect to parallel flip distances. More precisely, this asks for a triangulation that minimizes the sum of flip distances to all elements of the input",
  "title": "Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026"
}