Reassembling Broken Objects using Breaking Curves
Reassembling 3D broken objects is a challenging task. A robust solution that generalizes well must deal with diverse patterns associated with different types of broken objects. We propose a method that tackles the pairwise assembly of 3D point clouds, that is agnostic on the type of object, and that relies solely on their geometrical information, without any prior information on the shape of the reconstructed object. The method receives two point clouds as input and segments them into regions using detected closed boundary contours, known as breaking curves. Possible alignment combinations of the regions of each broken object are evaluated and the best one is selected as the final alignment. Experiments were carried out both on available 3D scanned objects and on a recent benchmark for synthetic broken objects. Results show that our solution performs well in reassembling different kinds of broken objects.
Code (1)
Tasks
ObjectSimilar Papers 제목 키워드 기반
Axially Symmetric 3D Pots Configuration System Using Axis of Symmetry and Break Curve
This paper introduces a novel approach for reassembling pot sherds found at archaeological excavation sites, for the purpose of reconstructing clay pots that had been made on a wheel. These pots and the sherds into which…
Breaking the Symmetries of Indistinguishable Objects
Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn from a set of unlabelled objects, and t…
validSpontaneous symmetry breaking in Quantum Finance
We analyze the phenomena of spontaneous symmetry breaking in Quantum Finance by using as a starting point the Black-Scholes (BS) and the Merton-Garman (MG) equations expressed in the Hamiltonian form. In this scenario th…
Many-Turn Jailbreaking
Current jailbreaking work on large language models (LLMs) aims to elicit unsafe outputs from given prompts. However, it only focuses on single-turn jailbreaking targeting one specific query. On the contrary, the advanced…
Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking
STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague…
Decision Making