Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/604
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Banković, Milan | en_US |
dc.contributor.author | Marić, Filip | en_US |
dc.date.accessioned | 2022-08-13T15:50:05Z | - |
dc.date.available | 2022-08-13T15:50:05Z | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 09257721 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/604 | - |
dc.description.abstract | Donald Knuth introduced abstract CC systems to represent configurations of points in a plane with a given orientation (clockwise or counterclockwise) of all triples of points. We present efficient enumeration of all non-isomorphic CC systems with at most 12 points. Our algorithm is based on Faradžev-Read type enumeration, enhanced with the homomorphism principle and SAT solving, enabling us to enumerate more than 1.3⋅1012 non-isomorphic CC systems with 12 points. | en |
dc.relation.ispartof | Computational Geometry: Theory and Applications | en |
dc.subject | CC systems | en |
dc.subject | Faradžev-Read enumeration | en |
dc.subject | Homomorphism principle | en |
dc.subject | Point triples orientation | en |
dc.subject | SAT solving | en |
dc.title | Faradžev Read-type enumeration of non-isomorphic CC systems | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.comgeo.2021.101770 | - |
dc.identifier.scopus | 2-s2.0-85103689609 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85103689609 | - |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.description.rank | M23 | en_US |
dc.relation.volume | 97 | en |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | Article | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0001-7219-6960 | - |
Appears in Collections: | Research outputs |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.