Reconstructing Orthogonal Polyhedra From Putative Vertex Sets
Loading...
Files
Date
2011
Authors
Genç, Burkay
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Open Access Color
HYBRID
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Top 10%
Influence
Top 10%
Popularity
Top 10%
Abstract
In this paper we study the problem of reconstructing orthogonal polyhedra from a putative vertex set, i.e., we are given a set of points and want to find an orthogonal polyhedron for which this is the set of vertices. This is well-studied in 2D; we mostly focus on 3D, and on the case where the given set of points may be rotated beforehand. We obtain fast algorithms for reconstruction in the case where the answer must be orthogonally convex. (C) 2011 Elsevier B.V. All rights reserved.
Description
ORCID
Keywords
Reconstruction, Vertex set, Orthogonal polyhedra, Computational Mathematics, Control and Optimization, Computational Theory and Mathematics, Orthogonal polyhedra, Geometry and Topology, Reconstruction, Vertex set, Computer Science Applications, reconstruction, Pattern recognition, speech recognition, pattern recognition, Computational aspects related to convexity, object recognition, Numerical aspects of computer graphics, image analysis, and computational geometry, Computer graphics; computational geometry (digital and algorithmic aspects), vertex set, orthogonal polyhedra
Fields of Science
0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Q2
Scopus Q
Q4
OpenCitations Citation Count
15
Source
Computatıonal Geometry-Theory And Applıcatıons
Volume
44
Issue
8
Start Page
409
End Page
417
PlumX Metrics
Citations
CrossRef : 7
Scopus : 15
Captures
Mendeley Readers : 4
Google Scholar™
