{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4698356","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4698356","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4698356","kernelVersion":"v1","immutable":true,"modified":"2024-07-30T08:00:20Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4698356","name":"OPTIMAL PARALLEL ALGORITHMS FOR TRIANGULATED SIMPLE POLYGONS","headline":"OPTIMAL PARALLEL ALGORITHMS FOR TRIANGULATED SIMPLE POLYGONS","description":"scientific article; zbMATH DE number 756031","url":"https://portal.mardi4nfdi.de/entity/Q4698356","datePublished":"1996-02-26","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1384195"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96577"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1142/S021819599500009X","url":"https://doi.org/10.1142/S021819599500009X"},"sameAs":["https://doi.org/10.1142/S021819599500009X"]},"provenance":{"prov:generatedAtTime":"2024-07-30T08:00:20Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}