Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)

Laurent Moalic, Dominique Schmitt, Julien Lepagnot, Julien Kritter

Open source

DOI: 10.4230/lipics.socg.2020.84
Published: 2020-06-08
Container: Not recorded
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fur Informatik
Open access: yes

Credibility signals

uncertain Score 51/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.4230/lipics.socg.2020.84,
  title = {Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)},
  author = {Laurent Moalic and Dominique Schmitt and Julien Lepagnot and Julien Kritter},
  year = {2020},
  doi = {10.4230/lipics.socg.2020.84},
  url = {https://doi.org/10.4230/lipics.socg.2020.84}
}

RIS

TY  - JOUR
TI  - Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)
AU  - Laurent Moalic
AU  - Dominique Schmitt
AU  - Julien Lepagnot
AU  - Julien Kritter
PY  - 2020
DO  - 10.4230/lipics.socg.2020.84
UR  - https://doi.org/10.4230/lipics.socg.2020.84
ER  -

APA

Moalic, L., Schmitt, D., Lepagnot, J., & Kritter, J. (2020). Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge). https://doi.org/10.4230/lipics.socg.2020.84

Source records

hal · retrieved 2026-09-25T06:02:26.188Z