Computational Geometry - Some Easy Questions and their Recent Solutions

Простая страница элемента
dc.creatorAurenhammer,Franz
dc.date2001
dc.date.accessioned2024-02-06T12:51:08Z
dc.date.available2024-02-06T12:51:08Z
dc.descriptionWe address three basic questions in computational geometry which can be phrased in simple terms but have only recently received (more or less) satisfactory answers: point set enumeration, optimum triangulation, and polygon decomposition.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-007-05-0338
dc.identifierhttps://lib.jucs.org/article/27785/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7950
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 7(5): 338-354
dc.subjectcomputational geometry
dc.subjectcombinatorial geometry
dc.subjectpoint set data base
dc.subjectminimum-weight triangulation
dc.subjectpolygonal skeleton
dc.titleComputational Geometry - Some Easy Questions and their Recent Solutions
dc.typeResearch Article
Файлы
Коллекции