Circumscribed sphere of a convex polyhedron

Chien, Mao-Ting; Nakazato, Hiroshi

doi:10.1016/j.aml.2005.02.008

Search citation statements

Order By: Relevance

Paper Sections

Select...

Circumscribed Circles1

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2005

2021

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its analogous discussion on a convex polyhedron is treated in [8]. Although the argument in this section is rather elementary, the results obtained are crucial to the study of the q-numerical range of a normal operator.…”

Section: Circumscribed Circlesmentioning

confidence: 96%

Theq-numerical ranges of normal operators

Chien

Nakazato

2005

Linear and Multilinear Algebra

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Circumscribed Circlesmentioning

confidence: 96%

Theq-numerical ranges of normal operators

Chien

Nakazato

2005

Linear and Multilinear Algebra

Self Cite

View full text Add to dashboard Cite

show abstract

“…• Spheres: Chien et al [40] computed the circumscribed sphere in O(n 4 ) time and O(kn 3 ) space. And Danciger et al [41] developed an algorithm to compute the sphere in O(n 4 ) time.…”

Section: Related Workmentioning

confidence: 99%

Finding the Largest Volume Parallelepipedon of Arbitrary Orientation in a Solid

et al. 2021

View full text Add to dashboard Cite

3D Computer Vision algorithms are a subject of research and application for several industrial processes. The Volume of Interest (VOI) usually refer to sub-objects with basic shapes for computing these algorithms. However, in many cases the objects are available as irregular shapes with many vertices, and in order to apply algorithms effectively, it is essential to compute the largest volume parallelepipedon contained in 3D objects. There are no other approximation algorithms for finding the largest volume parallelepipedon of arbitrary orientation inscribed in a closed 3D contour with a computational cost better than the algorithm proposed in this paper, been O(n 3 ).INDEX TERMS Parallelogram, parallelepipedon, polyhedron, volume of interest (VOI).

show abstract

Circumscribed sphere of a convex polyhedron

Cited by 2 publications

References 1 publication

Theq-numerical ranges of normal operators

Theq-numerical ranges of normal operators

Finding the Largest Volume Parallelepipedon of Arbitrary Orientation in a Solid

Contact Info

Product

Resources

About