Log in

Relevant bibliographies by topics / Polyhedra – Computer programs

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Polyhedra – Computer programs'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

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 – Computer programs.'

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 – Computer programs"

1

Hurteau, G., and N. F. Stewart. "Distance calculation for imminent collision indication in a robot System simulation." Robotica 6, no. 1 (1988): 47–51. http://dx.doi.org/10.1017/s0263574700003593.

Full text

Abstract:

SUMMARYMinimum distance algorithms may be used in robotic simulation programs to provide the user with the distances of approach of the manipulator to obstacles in the work environment; this is important for task planning using graphical simulation of configuration maps, and for the implementation of automatic detection of (imminent) collision in robot task development Systems that are based on a graphical simulation facility. In this paper we present algorithms that may be used for the calculation of distances between objects, not necessarily convex, that are made up of unions of convex polyh

APA, Harvard, Vancouver, ISO, and other styles

2

Iooss, Guillaume, Christophe Alias, and Sanjay Rajopadhye. "Monoparametric Tiling of Polyhedral Programs." International Journal of Parallel Programming 49, no. 3 (2021): 376–409. http://dx.doi.org/10.1007/s10766-021-00694-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yuki, Tomofumi, Paul Feautrier, Sanjay Rajopadhye, and Vijay Saraswat. "Array dataflow analysis for polyhedral X10 programs." ACM SIGPLAN Notices 48, no. 8 (2013): 23–34. http://dx.doi.org/10.1145/2517327.2442520.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Finger, Larry W., Martin Kroeker, and Brian H. Toby. "DRAWxtl, an open-source computer program to produce crystal structure drawings." Journal of Applied Crystallography 40, no. 1 (2007): 188–92. http://dx.doi.org/10.1107/s0021889806051557.

Full text

Abstract:

The computer programDRAWxtlproduces crystal structure drawings in the form of an interactive screen representation, as well as VRML files for use on web pages and in classroom teaching, and creates input files for the popularPersistence of Vision Raytracer(POV-Ray) rendering program for publication-quality graphics, including generation of stereo pairs.DRAWxtloutput produces the standard kinds of graphical representations: spheres, ellipsoids, bonds and polyhedra of any complexity. In addition, it can draw arrows to represent magnetic moments, show capped cones to indicate the location of lone

APA, Harvard, Vancouver, ISO, and other styles

5

Li, X. Z. "SVAT4: a computer program for visualization and analysis of crystal structures." Journal of Applied Crystallography 53, no. 3 (2020): 848–53. http://dx.doi.org/10.1107/s1600576720004586.

Full text

Abstract:

SVAT4 is a computer program for interactive visualization of three-dimensional crystal structures, including chemical bonds and magnetic moments. A wide range of functions, e.g. revealing atomic layers and polyhedral clusters, are available for further structural analysis. Atomic sizes, colors, appearance, view directions and view modes (orthographic or perspective views) are adjustable. Customized work for the visualization and analysis can be saved and then reloaded. SVAT4 provides a template to simplify the process of preparation of a new data file. SVAT4 can generate high-quality images fo

APA, Harvard, Vancouver, ISO, and other styles

6

Roullet, G., J. Raphanaud, and J. J. Legendre. "A user-friendly microcomputer program for modeling convex polyhedra." Computers & Geosciences 16, no. 4 (1990): 461–515. http://dx.doi.org/10.1016/0098-3004(90)90012-i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Blanc, E., D. Schwarzenbach, and H. D. Flack. "The evaluation of transmission factors and their first derivatives with respect to crystal shape parameters." Journal of Applied Crystallography 24, no. 6 (1991): 1035–41. http://dx.doi.org/10.1107/s002188989100835x.

Full text

Abstract:

Methods, implemented into a computer program (LSABS), are described which calculate transmission factors and their first derivatives with respect to the positions of the faces of a convex polyhedral monocrystal. Both Gaussian and analytical integration procedures are considered in detail. LSABS has been implemented as a module of the Xtal system of programs. It functions independently of the instrument used to collect the intensity data. Test results obtained with this program are compared with standard literature values. Correlation coefficients of an absorption-corrected intensity data set o

APA, Harvard, Vancouver, ISO, and other styles

8

Козневски and E. Kozniewski. "New Methods of the Computer Aided Design of Roof Skeletons." Geometry & Graphics 4, no. 2 (2016): 3–7. http://dx.doi.org/10.12737/19827.

Full text

Abstract:

The problem of efficient design of roofs is a topical area of research. This is confirmed by scientific studies [1–5, etс.]. Today, in the times of information technology in all areas of actively using the computer and specific programs [6; 12; 15, etc.]. The author presents a proposal of geometric design (geometric solutions) for roofs with restrictions, so-called &#34;roof with its neighbors.&#34;Roofs are treated as a special class of polyhedral surfaces. Construction includes a corresponding attachment roof with restrictions on the ro

APA, Harvard, Vancouver, ISO, and other styles

9

JABLAN, SLAVIK, and RADMILA SAZDANOVIĆ. "UNLINKING NUMBER AND UNLINKING GAP." Journal of Knot Theory and Its Ramifications 16, no. 10 (2007): 1331–55. http://dx.doi.org/10.1142/s0218216507005828.

Full text

Abstract:

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard–Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for which the unlinking number is unknown. Furthermore, we define BJ-unlinking gap and construct examples of links with arbitrarily large BJ-unlinking gap. Experimental results for BJ-unlinking gap of rational links up to 16 crossings, and all alternating links up to 12 crossings are

APA, Harvard, Vancouver, ISO, and other styles

10

Deng, Xiaodi, and Cheng Dong. "SMEPOC– a computer program for the automatic generation of trial structural models for inorganic compounds with symmetry restriction." Journal of Applied Crystallography 42, no. 5 (2009): 953–58. http://dx.doi.org/10.1107/s0021889809034062.

Full text

Abstract:

A new structure modelling algorithm that can automatically generate trial structure models based on a prior knowledge of the unit-cell content and space-group information is proposed. It can enumerate all possible equivalent position combination (EPC) models and eliminate unreasonable ones with symmetry restriction. Unlike other methods, it does not require the internal molecular connectivity or coordination polyhedron information and is mostly suitable for modelling inorganic crystals with independent atoms. Therefore, these EPC models can be used as input to global optimization procedures fo

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Polyhedra – Computer programs"

1

Gururaghavendran, Ashwin. "Applying Polyhedral Transformation to Fortran Programs." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1301032351.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Narayan, Mohanish. "PolyOpt/Fortran: A Polyhedral Optimizer for Fortran Programs." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338331413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chinnaswamy, Karthiyayini. "Compile Time Extraction And Instrumentation of Affine Program Kernels." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1276879069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Trifunovic, Konrad. "Efficient search-based strategies for polyhedral compilation : algorithms and experience in a production compiler." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00661334.

Full text

Abstract:

In order to take the performance advantages of the current multicore and heterogeneous architectures the compilers are required to perform more and more complex program transformations. The search space of the possible program optimizations is huge and unstructured. Selecting the best transformation and predicting the potential performance benefits of that transformation is the major problem in today's optimizing compilers. The promising approach to handling the program optimizations is to focus on the automatic loop optimizations expressed in the polyhedral model. The current approaches for o

APA, Harvard, Vancouver, ISO, and other styles

5

Bao, Wenlei. "Compiler Techniques for Transformation Verification, Energy Efficiency and Cache Modeling." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1524073563586939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wilde, Doran K. "A library for doing polyhedral operations." Thesis, 1993. http://hdl.handle.net/1957/37202.

Full text

Abstract:

Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures for operating on polyhedra can be used for doing loop transformations and other program restructuring transformations which are needed in parallelizing compilers. Thus a need for a library of polyhedral operations has recently been recognized in the parallelizing compiler community. Polyhedra are also used in the definition of domains of variables in systems of affine recurrence equations (SARE). ALPHA is a lang

APA, Harvard, Vancouver, ISO, and other styles

7

Chandan, G. "Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs." Thesis, 2014. http://hdl.handle.net/2005/3111.

Full text

Abstract:

Scientiﬁc applications that operate on large data sets require huge amount of computation power and memory. These applications are typically run on High Performance Computing (HPC) systems that consist of multiple compute nodes, connected over an network interconnect such as InﬁniBand. Each compute node has its own memory and does not share the address space with other nodes. A signiﬁcant amount of work has been done in past two decades on parallelizing for distributed-memory architectures. A majority of this work was done in developing compiler technologies such as high performance Fortran (H

APA, Harvard, Vancouver, ISO, and other styles

8

Bhaskaracharya, Somashekaracharya G. "Automatic Storage Optimization of Arrays Affine Loop Nests." Thesis, 2016. http://hdl.handle.net/2005/3208.

Full text

Abstract:

Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem size given a axed amount of main memory. The solutions found by existing techniques for automatic storage optimization for arrays in a new loop-nests, which minimize the storage requirements for the arrays, are often far from good or optimal and could even miss nearly all storage optimization potential. In this work, we present a new automatic storage optimization framework and techniques that can be used to achieve intra-array

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Polyhedra – Computer programs"

1

K, Law K., ed. Computer-aided sculpture. Cambridge University Press, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wilde, Doran K. A library for doing polyhedral operations. 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Polyhedra – Computer programs"

1

Hartisch, Michael, Thorsten Ederer, Ulf Lorenz, and Jan Wolf. "Quantified Integer Programs with Polyhedral Uncertainty Set." In Computers and Games. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50935-8_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cohen, Albert, Sylvain Girbal, and Olivier Temam. "A Polyhedral Approach to Ease the Composition of Program Transformations." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27866-5_38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Company, Pedro, Peter A. C. Varley, Raquel Plumed, and Jorge D. Camba. "Detection of Vertices in Sketched Drawings of Polyhedral Shapes." In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-13469-3_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Takahashi, Tetsuji, Mineichi Kudo, and Atsuyoshi Nakamura. "Classifier Selection in a Family of Polyhedron Classifiers." In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10268-4_51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Polyhedra – Computer programs"

1

Wilson, H. B., and G. S. Chang. "Line Integral Computation of Geometrical Properties of Plane Faces and Polyhedra." In ASME 1991 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/cie1991-0125.

Full text

Abstract:

Abstract Surface integrals arising during computation of geometrical properties of volumes are studied. Line integrals are formulated which give the contributions of a general plane surface area. These integrals are evaluated to provide more concise exact formulas for the geometrical properties of polyhedra than have been obtained previously. A short computer program for polyhedron properties is presented, along with numerical examples.

APA, Harvard, Vancouver, ISO, and other styles

2

Talwar, Rajeev, and Souran Manoochehri. "Algorithms to Detect Geometric Interactions in a Feature-Based Design System." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0071.

Full text

Abstract:

Abstract This paper presents efficient and accurate algorithms for the analytical detection of geometric interactions between features in a CAD environment. The developed methodology is meant to be utilized in a knowledge-based design system using feature-based modeling. The algorithms take surface information from the CAD system and use geometric inferencing to evaluate these interactions. Features represented by both convex and concave polyhedra are considered. The methodology developed here is able to deal with concave features effectively and, therefore, eliminates the need for their decom

APA, Harvard, Vancouver, ISO, and other styles

3

Sakurai, Hiroshi. "Decomposing a Delta Volume Into Maximal Convex Volumes and Sequencing Them for Machining." In ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium collocated with the ASME 1994 Design Technical Conferences. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/cie1994-0395.

Full text

Abstract:

Abstract A method has been developed to decompose a polyhedral delta volume, which is the volume difference between the raw material and the finished part, into maximal convex volumes by intersecting the halfspaces of the faces of the delta volume. The hypothesis behind this effort is that in machining a delta volume of complex shape it is more efficient to divide it into volumes of simple shapes and remove volume by volume with large cutters than to remove it as a single volume with a single small cutter. The maximality of a maximal convex volume represents the possibility of using a large cu

APA, Harvard, Vancouver, ISO, and other styles

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!