Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Reassembling fractured objects by geometric matching
We present a system for automatic reassembly of broken 3D solids. Given as input 3D digital
models of the broken fragments, we analyze the geometry of the fracture surfaces to find a …
models of the broken fragments, we analyze the geometry of the fracture surfaces to find a …
Breaking bad: A dataset for geometric fracture and reassembly
Abstract We introduce Breaking Bad, a large-scale dataset of fractured objects. Our dataset
consists of over one million fractured objects simulated from ten thousand base models. The …
consists of over one million fractured objects simulated from ten thousand base models. The …
A multiscale method for the reassembly of two-dimensional fragmented objects
HC da Gama Leitao, J Stolfi - IEEE Transactions on Pattern …, 2002 - ieeexplore.ieee.org
We describe an efficient procedure for reassembling unknown two-dimensional objects that
have been broken or torn into a large number of irregular fragments, a problem that often …
have been broken or torn into a large number of irregular fragments, a problem that often …
Fantastic breaks: A dataset of paired 3d scans of real-world broken objects and their complete counterparts
Automated shape repair approaches currently lack access to datasets that describe real-
world damaged geometry. We present Fantastic Breaks (and Where to Find Them …
world damaged geometry. We present Fantastic Breaks (and Where to Find Them …
From reassembly to object completion: A complete systems pipeline
The problem of the restoration of broken artifacts, where large parts could be missing, is of
high importance in archaeology. The typical manual restoration can become a tedious and …
high importance in archaeology. The typical manual restoration can become a tedious and …
A survey of geometric analysis in cultural heritage
We present a review of recent techniques for performing geometric analysis in cultural
heritage (CH) applications. The survey is aimed at researchers in the areas of computer …
heritage (CH) applications. The survey is aimed at researchers in the areas of computer …
Efficient sparse icp
The registration of two geometric surfaces is typically addressed using variants of the
Iterative Closest Point (ICP) algorithm. The Sparse ICP method formulates the problem using …
Iterative Closest Point (ICP) algorithm. The Sparse ICP method formulates the problem using …
Jigsaw: Learning to assemble multiple fractured objects
Automated assembly of 3D fractures is essential in orthopedics, archaeology, and our daily
life. This paper presents Jigsaw, a novel framework for assembling physically broken 3D …
life. This paper presents Jigsaw, a novel framework for assembling physically broken 3D …
A texture based matching approach for automated assembly of puzzles
MS Sagiroglu, A Erçil - 18th International Conference on …, 2006 - ieeexplore.ieee.org
The puzzle assembly problem has many application areas such as restoration and
reconstruction of archeological findings, repairing of broken objects, solving jigsaw type …
reconstruction of archeological findings, repairing of broken objects, solving jigsaw type …
On the automatic assemblage of arbitrary broken solid artefacts
G Papaioannou, EA Karabassi - Image and Vision Computing, 2003 - Elsevier
Presented here is a fast method that combines curve matching techniques with a surface
matching algorithm to estimate the positioning and respective matching error for the joining …
matching algorithm to estimate the positioning and respective matching error for the joining …