Relevant bibliographies by topics / Polyhedra

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Polyhedra'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Polyhedra.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Polyhedra"

1

Makovicky, E., and T. Balić-Žunić. "New Measure of Distortion for Coordination Polyhedra." Acta Crystallographica Section B Structural Science 54, no. 6 (1998): 766–73. http://dx.doi.org/10.1107/s0108768198003905.

Full text
Abstract:
A new global measure of distortion for coordination polyhedra is proposed, based on a comparison of the ratios Vs (circumscribed sphere)/Vp (polyhedron) calculated, respectively, for the real and ideal polyhedra of the same number of coordinated atoms which have the same circumscribed sphere. This formula can be simplified to υ (%) = 100[Vi (ideal) − Vr (real)]/Vi , where Vi and Vr are the volumes of the above-defined polyhedra. The global distortion can be combined with other polyhedral characteristics, e.g. with the eccentricity of the central atom in the polyhedron or with the degree of sph
APA, Harvard, Vancouver, ISO, and other styles
2

Senesi, Andrew, and Byeongdu Lee. "Scattering functions of polyhedra." Journal of Applied Crystallography 48, no. 2 (2015): 565–77. http://dx.doi.org/10.1107/s1600576715002964.

Full text
Abstract:
Herein, a general method to calculate the scattering functions of polyhedra, including both regular and semi-regular polyhedra, is presented. These calculations may be achieved by breaking a polyhedron into sets of congruent pieces, thereby reducing computation time by taking advantage of Fourier transforms and inversion symmetry. Each piece belonging to a set or subunit can be generated by either rotation or translation. Further, general strategies to compute truncated, concave and stellated polyhedra are provided. Using this method, the asymptotic behaviors of the polyhedral scattering funct
APA, Harvard, Vancouver, ISO, and other styles
3

Eason, Jane E., Robert H. Hice, Jeffrey J. Johnson, and Brian A. Federici. "Effects of Substituting Granulin or a Granulin-Polyhedrin Chimera for Polyhedrin on Virion Occlusion and Polyhedral Morphology in Autographa californicaMultinucleocapsid Nuclear Polyhedrosis Virus." Journal of Virology 72, no. 7 (1998): 6237–43. http://dx.doi.org/10.1128/jvi.72.7.6237-6243.1998.

Full text
Abstract:
ABSTRACT Substitution of granulin from the Trichoplusia nigranulosis virus (TnGV) for polyhedrin of the Autographa californica multinucleocapsid nuclear polyhedrosis virus (AcMNPV) yielded a few very large (2 to 5 μm) cuboidal inclusions in the cytoplasm and nucleus of infected cells. These polyhedra lacked the beveled edges characteristic of wild-type AcMNPV polyhedra, contained fractures, and occluded few virions. Placing a nuclear localization signal (KRKK) in granulin directed more granulin to the nucleus and resulted in more structurally uniform cuboidal inclusions in which no virions wer
APA, Harvard, Vancouver, ISO, and other styles
4

Bokowski, Jürgen, and Kevin H. "Polyhedral Embeddings of Triangular Regular Maps of Genus g, 2 ⩽ g ⩽ 14, and Neighborly Spatial Polyhedra." Symmetry 17, no. 4 (2025): 622. https://doi.org/10.3390/sym17040622.

Full text
Abstract:
This article provides a survey of polyhedral embeddings of triangular regular maps of genus g, 2⩽g⩽14, and of neighborly spatial polyhedra. An old conjecture of Grünbaum from 1967, although disproved in 2000, lies behind this investigation. We discuss all duals of these polyhedra as well, whereby we accept, e.g., the Szilassi torus with its non-convex faces to be a dual of the Möbius torus. A numerical optimization approach by the second author for finding such embeddings was first applied to finding (unsuccessfully) a dual polyhedron of one of the 59 closed oriented surfaces with the complete
APA, Harvard, Vancouver, ISO, and other styles
5

Koźniewski, Edwin. "Flat Tessellations in Search of a Dome Shape." Buildings 15, no. 3 (2025): 453. https://doi.org/10.3390/buildings15030453.

Full text
Abstract:
Based on the design solutions of the Orthodox Church and while maintaining the conventions of polyhedral surfaces, the author describes and analyzes new 3D geometric solids (structures) modeled on tessellations. The pretext for undertaking the research was the need to find a polyhedron shape that could replace the curvilinear shape of a burning candle flame that had been used for centuries in Orthodox church architecture. The innovative idea of designing polyhedral domes of Orthodox churches led the designer to interesting structures that are not derived from either regular or semiregular poly
APA, Harvard, Vancouver, ISO, and other styles
6

Ju, Ming-Yi, Ming-Yi Ju, Jing-Sin Liu, et al. "Fast and accurate collision detection based on enclosed ellipsoid." Robotica 19, no. 4 (2001): 381–94. http://dx.doi.org/10.1017/s0263574700003295.

Full text
Abstract:
A fast and accurate method for detecting the collisions of convex polyhedra in a graphical simulation environment based on a newly developed method of distance estimate is presented. By the simultaneous use of the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding volume for object representation, and more efficient than the polyhedral methods. An approach for computing the enclosed ellipsoid of a convex polyhedron by compressing, stretching and scaling operations on its best-fit enclosing ellipso
APA, Harvard, Vancouver, ISO, and other styles
7

FEKETE, SÁNDOR P., and JOSEPH S. B. MITCHELL. "TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING." International Journal of Computational Geometry & Applications 11, no. 06 (2001): 647–68. http://dx.doi.org/10.1142/s0218195901000687.

Full text
Abstract:
We consider a problem that arises in generating three-dimensional models by methods of layered manufacturing: How does one decompose a given model P into a small number of sub-models each of which is a terrain polyhedron? Terrain polyhedra have a base facet such that, for each point of the polyhedron, the line segment joining the point to its orthogonal projection on the base facet lies within the polyhedron. Terrain polyhedra are exactly the class of polyhedral models for which it is possible to construct the model using layered manufacturing (with layers parallel to the base facet), without
APA, Harvard, Vancouver, ISO, and other styles
8

Lalik, Erwin. "Shannon information as a measure of distortion in coordination polyhedra." Journal of Applied Crystallography 38, no. 1 (2005): 152–57. http://dx.doi.org/10.1107/s0021889804030638.

Full text
Abstract:
Variations in the distribution of bond orders within coordination polyhedra in crystals have been used as a scale of departure from perfect polyhedral symmetry and a measure of polyhedral distortion. The distribution of bond orders mathematically resembles the probability distribution; the bond orders can be normalized to their sum within a polyhedron and used to calculate the Shannon information content that depends on the degree of their departure from uniform distribution. The difference in the Shannon information between a perfect and a distorted polyhedron can be defined as a function tak
APA, Harvard, Vancouver, ISO, and other styles
9

Chubanov, Sergei. "On the Complexity of PAC Learning in Hilbert Spaces." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 6 (2023): 7202–9. http://dx.doi.org/10.1609/aaai.v37i6.25878.

Full text
Abstract:
We study the problem of binary classification from the point of view of learning convex polyhedra in Hilbert spaces, to which one can reduce any binary classification problem. The problem of learning convex polyhedra in finite-dimensional spaces is sufficiently well studied in the literature. We generalize this problem to that in a Hilbert space and propose an algorithm for learning a polyhedron which correctly classifies at least 1 − ε of the distribution, with a probability of at least 1 − δ, where ε and δ are given parameters. Also, as a corollary, we improve some previous bounds for polyhe
APA, Harvard, Vancouver, ISO, and other styles
10

Wecker, Lakin, John Hall, and Faramarz F. Samavati. "Constructing Efficient Mesh-Based Global Grid Systems with Reduced Distortions." ISPRS International Journal of Geo-Information 13, no. 11 (2024): 373. http://dx.doi.org/10.3390/ijgi13110373.

Full text
Abstract:
Recent advancements in geospatial technologies have significantly expanded the volume and diversity of geospatial data, unlocking new and innovative applications that require novel Geographic Information Systems (GIS). (Discrete) Global Grid Systems (DGGSs) have emerged as a promising solution to further enhance modern geospatial capabilities. Current DGGSs employ a simple, low-resolution polyhedral approximation of the Earth for efficient operations, but require a projection between the Earth’s surface and the polyhedral faces. Equal-area DGGSs are desirable for their low distortion, but they
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Polyhedra"

1

Shang, Hui. "Polyhedrin gene expression on protein production and polyhedra." Miami University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=miami1532540645318048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Eshaq, Hassan. "Polyhedral models." Link to electronic thesis, 2002. http://www.wpi.edu/Pubs/ETD/Available/etd-0501102-141322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Upadrasta, Ramakrishna. "Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00818764.

Full text
Abstract:
The goal of this thesis is to design algorithms that run with better complexity when compiling or parallelizing loop programs. The framework within which our algorithms operate is the polyhedral model of compilation which has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations of the above framework remain one important weakness. We address it by introducing sub-polyhedral compilation by using (Unit-)Two-Variable-Per-Inequality or (U)TVPI Polyhedra, namely polyhedrawith restricted c
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Iila Jingjiao. "Flexible polyhedra : exploring finite mechanisms of triangulated polyhedra." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/271806.

Full text
Abstract:
In a quest to design novel deployable structures, flexible polyhedra provide interesting insights. This work follows the discovery of flexible polyhedra and aims to make flexible polyhedra more useful. The dissertation describes how flexible polyhedra can be made. The flexible polyhedra first considered in this dissertation have a rotational degree of freedom. The range of this rotational movement is measured and maximised in this work by numerical maximisation. All polyhedra are established computationally: an iterative solution method is used to find vertex coordinates; several clash detecti
APA, Harvard, Vancouver, ISO, and other styles
5

Benton, P. A. "Unfolding polyhedra." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596583.

Full text
Abstract:
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proof of this has escaped discovery. This dissertation presents several new directions in the quest for the proof. Also discussed is a method which may lead to a counterexample to the conjecture through the construction of ‘hard to unfold’ polyhedra. Algorithmic solutions are discussed for the task of determining the specific set of edges which must be cut in order that an unfolding not self-intersect. A series of <i>Unfolder </i>algorithms are explored and compared, in terms of both algorithmic des
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Julie. "Folding Orthogonal Polyhedra." Thesis, Waterloo, Ont. : University of Waterloo [Dept. of Computer Science], 1999. http://etd.uwaterloo.ca/etd/jsun1999.pdf.

Full text
Abstract:
Thesis (M.Math.)-University of Waterloo, 1999.<br>Includes bibliographical references (leaves 42-44). Issued also in PDF format and available via the World Wide Web. Requires Internet connectivity, World Wide Web browser, and Adobe Acrobat Reader.
APA, Harvard, Vancouver, ISO, and other styles
7

Chang, Shiow-Yun. "2-lattice polyhedra." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/25704.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lucier, Brendan. "Unfolding and Reconstructing Polyhedra." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1037.

Full text
Abstract:
This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information. For each topic, we describe previous work in the area and present an array of new research and results. Our work on unfolding is motivated by the problem of characterizing precisely when overlaps will occur when a polyhedron is cut along edges and unfolded. By contrast to previous work, we begin by classifying overlaps according to a notion of locality. This classification enables us to focus upon particular types of overlaps, and use the results to c
APA, Harvard, Vancouver, ISO, and other styles
9

ALOE, FRANCESCO. "INTERMEDIATE LOGICS AND POLYHEDRA." Doctoral thesis, Università degli Studi di Milano, 2018. http://hdl.handle.net/2434/585697.

Full text
Abstract:
Polyhedra enjoy a peculiar property: every geometric shape with a certain “regularity” – in specific terms, certain classes of (closed) topological manifolds – can be captured by a polyhedron via triangulation, that is, by subdividing the geometric shapes into appropriate “triangles”, called simplices (which, in the 1- and 0-dimensional case, are simply edges and vertices, respectively). Therefore, one might well wonder: what is the intermediate logic of the class of triangulable topological manifolds of a given dimension d? The main result of the present work is to give the answer to this que
APA, Harvard, Vancouver, ISO, and other styles
10

Chan, Chi Kin. "On the classification of polyhedra /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20CHAN.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Polyhedra"

1

Cromwell, Peter R. Polyhedra. Cambridge University Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wachman, A. Infinite polyhedra. Faculty of Architecture and Town Planning of the Technion, Israel Institute of Technology, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Viana, Vera, Helena Mena Matos, and João Pedro Xavier, eds. Polyhedra and Beyond. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99116-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

O'Rourke, Joseph, and Costin Vîlcu. Reshaping Convex Polyhedra. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-47511-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pugh, Anthony. Polyhedra: A visual approach. Dale Seymour Publications, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jean, Pedersen, ed. Build your own polyhedra. Innovative Learning Publications, Addison-Wesley Pub. Co., 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

David, Avis, Bremner D, and Deza Antoine 1966-, eds. Polyhedral computation. American Mathematical Society, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Davis, Michael W. Infinite Group Actions on Polyhedra. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-48443-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bent, Fuglede, ed. Harmonic maps between Riemannian polyhedra. Cambridge University Press, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cooper Union for the Advancement of Science and Art, ed. Ad quadratum construction and study of the regular polyhedra. The Louis and Jeanette Brooks Engineering Design Center, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Polyhedra"

1

Liu, Mengman, Chuhua Ding, and Hui Wang. "An Exploration on the Form Design of Movable Structures Based on Uniform Convex Polyhedral Expansion." In Computational Design and Robotic Fabrication. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-8405-3_7.

Full text
Abstract:
Abstract5 kinds of regular polyhedra and 13 kinds of semi-regular polyhedra are taken as the main research objects in this paper to explore the form design method of polyhedral expansion through the rotation of polygon. Firstly, the expandable range of uniform convex polyhedra is defined and divided into two types of expansion. Then three solutions are proposed, namely, discarding polygonal faces, constructing rigid-foldable origami mechanisms and constructing scissor-like elements, so that the prior unexpandable uniform convex polyhedron can be expanded. These methods extend the range of expa
APA, Harvard, Vancouver, ISO, and other styles
2

Frank, J. Howard, J. Howard Frank, Michael C. Thomas, et al. "Polyhedron (pl., polyhedra)." In Encyclopedia of Entomology. Springer Netherlands, 2008. http://dx.doi.org/10.1007/978-1-4020-6359-6_3045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Huggett, Stephen, and David Jordan. "Polyhedra." In A Topological Aperitif. Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-3694-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hartshorne, Robin. "Polyhedra." In Undergraduate Texts in Mathematics. Springer New York, 2000. http://dx.doi.org/10.1007/978-0-387-22676-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Faigle, Ulrich, Walter Kern, and Georg Still. "Polyhedra." In Kluwer Texts in the Mathematical Sciences. Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-015-9896-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Huggett, Stephen, and David Jordan. "Polyhedra." In A Topological Aperitif. Springer London, 2008. http://dx.doi.org/10.1007/978-1-84800-913-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lancia, Giuseppe, and Paolo Serafini. "Polyhedra." In EURO Advanced Tutorials on Operational Research. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-63976-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Whittlesey, Marshall A. "Polyhedra." In Spherical Geometry and Its Applications. Chapman and Hall/CRC, 2019. http://dx.doi.org/10.1201/9780429328800-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pitchanathan, Arjun, Albert Cohen, Oleksandr Zinenko, and Tobias Grosser. "Strided Difference Bound Matrices." In Computer Aided Verification. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65627-9_14.

Full text
Abstract:
AbstractA wide range of symbolic analysis and optimization problems can be formalized using polyhedra. Sub-classes of polyhedra, also known as sub-polyhedral domains, are sought for their lower space and time complexity. We introduce the Strided Difference Bound Matrix (SDBM) domain, which represents a sweet spot in the context of optimizing compilers. Its expressiveness and efficient algorithms are particularly well suited to the construction of machine learning compilers. We present decision algorithms, abstract domain operators and computational complexity proofs for SDBM. We also conduct a
APA, Harvard, Vancouver, ISO, and other styles
10

Futer, David, Efstratia Kalfagianni, and Jessica Purcell. "Ideal Polyhedra." In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33302-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Polyhedra"

1

Maza, Stéphane, Jean-Claude Léon, and Frédéric Noël. "Mesh Construction Dedicated to a Multi-Representation for Structure Analysis Based on an Initial Polyhedral Geometry." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/cie-4446.

Full text
Abstract:
Abstract The aim of this paper is to present the first part of a new approach devoted to the generation of a data structure and operators for the hierarchical representation of 3D polyhedra. Here are described the treatments which allow to create some of the elements of this hierarchical model. At first, partitions of the initial polyhedron are mapped into planar connex hulls. Then, these domains are used like a piecewise parametric 2D space for subsequent polyhedra generations. In order to create such a mapping, the initial 3D polyhedron is partitioned to produce simply convex subsets which c
APA, Harvard, Vancouver, ISO, and other styles
2

Koltun, Vladlen, and Micha Sharir. "Polyhedral Voronoi diagrams of polyhedra in three dimensions." In the eighteenth annual symposium. ACM Press, 2002. http://dx.doi.org/10.1145/513400.513428.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Stine, William Wren, and Montie McMickell. "Stereopsis and the discrimination of rigidity." In OSA Annual Meeting. Optica Publishing Group, 1992. http://dx.doi.org/10.1364/oam.1992.thvv1.

Full text
Abstract:
Isometric projections of three-dimensional, rigidly rotating polyhedra appear to deform under certain circumstances (Green, 1961, JEP). Relative to those that appear to be rigid, rigidly rotating polyhedra that appear to deform are more difficult to discriminate from ones that actually deform during rotation (Sparrow and Stine, 1990, ARVO). When a rigidly rotating polyhedron appears to deform, the introduction of retinal disparity can result in the perception of rigidity (Sparrow and Stine, 1987a, ARVO). We used polyhedra that were configured either to appear nonrigid or to appear rigid while
APA, Harvard, Vancouver, ISO, and other styles
4

Shcherbakov, Oleg Sergeevich. "Binary trees polyhedra." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-78.

Full text
Abstract:
n this paper, we study minimal fillings of finite metric spaces (an object that arose as a generalization of the concepts of the shortest tree and minimal filling in the sense of Gromov). As you know, the weight minimum filling of a given type can be found as a solution linear programming problems or using the so-called multitours. The relationship between these two approaches can be seen passing to the dual problem of linear programming: rational points of a convex polyhedron, which is constructed according to the type of filling, correspond to multitours. This work is devoted to the study of
APA, Harvard, Vancouver, ISO, and other styles
5

Hobbs, Linn W. "What Can Topological Models Tell Us About Glass Structure and Properties?" In Bragg Gratings, Photosensitivity, and Poling in Glass Fibers and Waveguides. Optica Publishing Group, 1997. http://dx.doi.org/10.1364/bgppf.1997.jsua.2.

Full text
Abstract:
Atomic arrangements in condensed matter partition three-dimensional space into polyhedra whose edges are interatomic vectors. These polyhedra, formally known as void polytopes, fill (tesselate) space, and their identity and arrangement can provide one description of a given atomic arrangement (Figure 1a) [1]. Other tessellations associated with space-filling of random structures are Voronoi polyhedral cells [2] and their dual the Delauney network [3]. These tessellations are relatively intuitive in two dimensions, but considerably more complex in three-dimensions—for example in tetrahedral net
APA, Harvard, Vancouver, ISO, and other styles
6

Haggard, Hal. "Curved polyhedra." In Frontiers of Fundamental Physics 14. Sissa Medialab, 2016. http://dx.doi.org/10.22323/1.224.0162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Upadrasta, Ramakrishna, and Albert Cohen. "Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra." In the 40th annual ACM SIGPLAN-SIGACT symposium. ACM Press, 2013. http://dx.doi.org/10.1145/2429069.2429127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Devadoss, Satyan, and Shannon Starkey. "Flexing on Topology, or, Contrapposto Architecture." In 109th ACSA Annual Meeting Proceedings. ACSA Press, 2021. http://dx.doi.org/10.35483/acsa.am.109.48.

Full text
Abstract:
In 1977, mathematician Robert Connelly discovered a unique eighteen-sided closed, hinged polyhedron that, remarkably, wiggled, overturning centuries of mathematical discourse linking polyhedra with rigidity. This new category of polyhedra is the source of an ongoing interdisciplinary collaboration between architecture and discrete geometry. The flexible polyhedron serves as a generative design tool to develop a new approach to structure and a new relationship of the body in space, as well as an analytical lens through which to understand and challenge the history of architecture’s close associ
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, C. Y., and R. W. Mayne. "Distance Calculations in Motion Planning Problems With Interference Situations." In ASME 1990 Design Technical Conferences. American Society of Mechanical Engineers, 1990. http://dx.doi.org/10.1115/detc1990-0018.

Full text
Abstract:
Abstract This paper discusses distance calculations for three dimensional polyhedra with the assumption of convex bodies. An n-surface convex polyhedron is viewed as the intersection of n half-spaces and is represented by n linear inequality equations while the square of the distance between two points is of a quadratic form in terms of two sets of x-y-z coordinates. The static distance-to-contact between two non-interfering convex polyhedral shapes is then directly solvable by quadratic programming. Based on the concept of distance-past-contact, distance calculations for situations with inter
APA, Harvard, Vancouver, ISO, and other styles
10

Eisenbrand, Friedrich, Nicolai Hähnle, and Thomas Rothvoß. "Diameter of polyhedra." In the 25th annual symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1542362.1542428.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Polyhedra"

1

Wilson, Randall H., and Achim Schweikard. Assembling Polyhedra with Single Translations. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada254623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Haddad, Timothy S., and Brent D. Viers. Organic Polymers Modified with Inorganic Polyhedra. Defense Technical Information Center, 2002. http://dx.doi.org/10.21236/ada410052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Haddad, Timothy S., Andre Lee, and Shawn H. Phillips. Poly(Dimethysiloxanes) Modified with Inorganic Polyhedra. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada410326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mount, David M. On Finding Shortest Paths on Convex Polyhedra. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada166246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Balas, Egon. On the Convex Hull of the Union of Certain Polyhedra. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada197982.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Osypova, Nataliia V., and Volodimir I. Tatochenko. Improving the learning environment for future mathematics teachers with the use application of the dynamic mathematics system GeoGebra AR. [б. в.], 2021. http://dx.doi.org/10.31812/123456789/4628.

Full text
Abstract:
Immersive technologies and, in particular, augmented reality (AR) are rapidly changing the sphere of education, especially in the field of science, technology, engineering, arts and mathematics. High- quality professional training of a future mathematics teacher who is able to meet the challenges that permeate all sides, the realities of the globalizing information society, presupposes reliance on a highly effective learning environment. The purpose of the research is to transform the traditional educational environment for training future mathematics teachers with the use of the GeoGebra AR d
APA, Harvard, Vancouver, ISO, and other styles
7

Thompson, Kelly Glen. A Spatial Discretization Scheme for Solving the Transport Equation on Unstructured Grids of Polyhedra. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/775871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bilous, Vladyslav V., Volodymyr V. Proshkin, and Oksana S. Lytvyn. Development of AR-applications as a promising area of research for students. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4409.

Full text
Abstract:
The article substantiates the importance of using augmented reality in the educational process, in particular, in the study of natural and mathematical disciplines. The essence of AR (augmented reality), characteristics of AR hardware and software, directions and advantages of using AR in the educational process are outlined. It has proven that AR is a unique tool that allows educators to teach the new digital generation in a readable, comprehensible, memorable and memorable format, which is the basis for developing a strong interest in learning. Presented the results of the international stud
APA, Harvard, Vancouver, ISO, and other styles
9

Viers, Brent D., Alan Esker, and Katie Farmer. Polyhedral Oligomeric Silsesquioxanes Surfactants. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada410399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Haddad, Timothy S., Brent D. Viers, and Shawn H. Phillips. Polyhedral Oligomeric Silsesquioxane (POSS) Styrene Macromers. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada410398.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Polyhedra' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography