Full metadata record
DC FieldValueLanguage
dc.contributor.authorLeităo, H. C. G.
dc.contributor.authorStolfi, J.
dc.contributor.editorSkala, Václav
dc.identifier.citationWSCG '2000: Conference proceeding: The 8th International Conference in Central Europe on Computers Graphics, Visualization and Interaktive Digital Media '2000 in cooperation with EUROGRAPHICS and IFIP WG 5.10: University of West Bohemia, Plzen, Czech republic, February 7 - 10, 2000, p. 389-395.en
dc.description.abstractReassembling unknown broken objects from a large collection of fragments is a common problem in archaeology and other fields. Computer tools have recently been developed by the authors and by others, which try to help by locating pairs of fragments with matching outline shapes. These tools have been succesfully tested on small collections of fragments. Here we address the question of whether such tools can be expected to work for practical instances of the problem (103 to 105 fragments). To that end, we describe here a method to measure the average amount of information contained in the shape of a fracture line of given length. This parameter tells us how many false matches we can expect to find for that fracture among a given set of fragments; and we show that outline comparison should give useful results even for large instances.en
dc.format7 s.cs
dc.publisherUniversity of West Bohemiaen
dc.relation.ispartofseriesWSCG '2000: Conference proceedingen
dc.rights© University of West Bohemiaen
dc.subjectlinie lomucs
dc.subjectrozpoznávání vzorůcs
dc.subjectporovnávání konturcs
dc.titleInformation Contents of Fracture Linesen
dc.typekonferenční příspěvekcs
dc.subject.translatedfracture linesen
dc.subject.translatedpattern recognitionen
dc.subject.translatedcontour matchingen
Appears in Collections:WSCG '2000: Conference proceeding

Files in This Item:
File Description SizeFormat 
Leitao.pdfPlný text918,99 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15481

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.