Relevant bibliographies by topics / Boolean of Polyhedral Solids

Academic literature on the topic 'Boolean of Polyhedral Solids'

Author: Grafiati
Published: 6 September 2023

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

Select a source type:

Contents

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

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 "Boolean of Polyhedral Solids"

1

I.CHUBAREV, ALEXANDER. "ROBUST SET OPERATIONS ON POLYHEDRAL SOLIDS: A FIXED PRECISION APPROACH." International Journal of Computational Geometry & Applications 06, no. 02 (June 1996): 187–204. http://dx.doi.org/10.1142/s0218195996000137.

Full text
Abstract:
An approach to the reliable boundary evaluation for polyhedral solids is proposed. The approach is based on the three ideas: an approximate evaluation of the Boolean operations is performed; precise calculations are performed at micro-level by using only exact numbers; triangulations are used for the boundary representation. Test examples illustrating efficiency of the approach are presented.
APA, Harvard, Vancouver, ISO, and other styles
2

JUAN-ARINYO, ROBERT, ÀLVAR VINACUA, and PERE BRUNET. "CLASSIFICATION OF A POINT WITH RESPECT TO A POLYHEDRON VERTEX." International Journal of Computational Geometry & Applications 06, no. 02 (June 1996): 157–67. http://dx.doi.org/10.1142/s0218195996000113.

Full text
Abstract:
Algorithms for solid boolean operations are strongly based on classifying points with respect to solids. Several algorithms for solving the point-in- polyhedron problem in Brep schemes have been proposed in the literature. In this context, this paper describes an algorithm for the classification of an arbitrary point in the region dose to a polyhe-dron vertex. The algorithm is simple, has linear complexity and does not suffer from singularities. It performs better than previous algorithms, which would be too expensive in this particular case. The proposed algorithm is especially well suited for Brep schemes including spatial data structures for geometric data localization and searching, for operations on octree and extended octree structures, and for boundary evaluation of CSG trees with polyhedral primitives. Its use in the general point-in-polyhedron classification problem is also discussed. The algorithm is based on an extension to point in unbounded polygon of the kinetic framework of Guibas et al.
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, C. C. L. "Approximate Boolean Operations on Large Polyhedral Solids with Partial Mesh Reconstruction." IEEE Transactions on Visualization and Computer Graphics 17, no. 6 (June 2011): 836–49. http://dx.doi.org/10.1109/tvcg.2010.106.

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

Toriya, H., T. Takamura, T. Satoh, and H. Chiyokura. "Boolean operations for solids with free-form surfaces through polyhedral approximation." Visual Computer 7, no. 2-3 (March 1991): 87–96. http://dx.doi.org/10.1007/bf01901179.

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

Menon, Jai, and Baining Guo. "Free-Form Modeling in Bilateral Brep and CSG Representation Schemes." International Journal of Computational Geometry & Applications 08, no. 05n06 (October 1998): 537–75. http://dx.doi.org/10.1142/s0218195998000278.

Full text
Abstract:
This paper presents a unified approach for incorporating free-form solids in bilateral Brep and CSG representation schemes, by resorting to low-degree (quadratic, cubic) algebraic surface patches. We develop a general CSG solution that represents a free-form solid as a boolean combination of a direct term and a complicated delta term. This solution gives rise to the trunctet-subshell conditions, under which the delta term computation can be obviated. We use polyhedral smoothing to construct a Brep consisting of quadratic algebraic patches that meet with tangent-plane continuity, such that the trunctet-subshell conditions are guaranteed automatically. This guarantee is not currently available for cubic patches. The general CSG solution thus applies whenever trunctet-subshell conditions are violated, e.g. sometimes for cubic patches or sometimes for patches of any degree that are subject to shape control operations. Manifold solids of arbitrary topology can be represented in our dual representation system. Ensuing CSG constructs are parallel processed on the RayCasting Engine to support a wide range of solid modeling applications, including general sweeping, Minkowski operations, NC machining, and touch-sense probing.
APA, Harvard, Vancouver, ISO, and other styles
6

Landier, Sâm. "Boolean Operations on Arbitrary Polyhedral Meshes." Procedia Engineering 124 (2015): 200–212. http://dx.doi.org/10.1016/j.proeng.2015.10.133.

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

Diazzi, Lorenzo, and Marco Attene. "Convex polyhedral meshing for robust solid modeling." ACM Transactions on Graphics 40, no. 6 (December 2021): 1–16. http://dx.doi.org/10.1145/3478513.3480564.

Full text
Abstract:
We introduce a new technique to create a mesh of convex polyhedra representing the interior volume of a triangulated input surface. Our approach is particularly tolerant to defects in the input, which is allowed to self-intersect, to be non-manifold, disconnected, and to contain surface holes and gaps. We guarantee that the input surface is exactly represented as the union of polygonal facets of the output volume mesh. Thanks to our algorithm, traditionally difficult solid modeling operations such as mesh booleans and Minkowski sums become surprisingly robust and easy to implement, even if the input has defects. Our technique leverages on the recent concept of indirect geometric predicate to provide an unprecedented combination of guaranteed robustness and speed, thus enabling the practical implementation of robust though flexible solid modeling systems. We have extensively tested our method on all the 10000 models of the Thingi10k dataset, and concluded that no existing method provides comparable robustness, precision and performances.
APA, Harvard, Vancouver, ISO, and other styles
8

Verroust, A. "Visualization algorithm for CSG polyhedral solids." Computer-Aided Design 19, no. 10 (December 1987): 527–33. http://dx.doi.org/10.1016/0010-4485(87)90089-3.

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

Hoffmann, C. M., J. E. Hopcroft, and M. J. Karasick. "Robust set operations on polyhedral solids." IEEE Computer Graphics and Applications 9, no. 6 (November 1989): 50–59. http://dx.doi.org/10.1109/38.41469.

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

Landier, Sâm. "Boolean operations on arbitrary polygonal and polyhedral meshes." Computer-Aided Design 85 (April 2017): 138–53. http://dx.doi.org/10.1016/j.cad.2016.07.013.

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

Dissertations / Theses on the topic "Boolean of Polyhedral Solids"

1

ARRUDA, MARCOS CHATAIGNIER DE. "BOOLEAN OPERATIONS WITH COMPOUND SOLIDS REPRESENTED BY BOUNDARY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6688@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
TECNOLOGIA EM COMPUTAÇÃO GRÁFICA
Num modelador de sólidos, uma das ferramentas mais poderosas para a criação de objetos tridimensionais de qualquer nível de complexidade geométrica é a aplicação das operações booleanas. Elas são formas intuitivas e populares de combinar sólidos, baseadas nas operações aplicadas a conjuntos. Os tipos principais de operações booleanas comumente aplicadas a sólidos são: união, interseção e diferença. Havendo interesse prático, para garantir que os objetos resultantes possuam a mesma dimensão dos objetos originais, sem partes soltas ou pendentes, o processo de regularização é aplicado. Regularizar significa restringir o resultado de tal forma que apenas volumes preenchíveis possam existir. Na prática, a regularização é realizada classificando-se os elementos topológicos e eliminando-se estruturas de dimensão inferior. A proposta deste trabalho é o desenvolvimento de um algoritmo genérico que permita a aplicação do conjunto de operações booleanas em um ambiente de modelagem geométrica aplicada à análise por elementos finitos e que agregue as seguintes funcionalidades: trabalhar com um número indefinido de entidades topológicas (conceito de Grupo), trabalhar com objetos de dimensões diferentes, trabalhar com objetos non-manifold, trabalhar com objetos não necessariamente poliedrais ou planos e garantir a eficiência, robustez e aplicabilidade em qualquer ambiente de modelagem baseado em representação B-Rep. Neste contexto, apresenta-se a implementação do algoritmo num modelador geométrico pré- existente, denominado MG, seguindo o conceito de programação orientada a objetos e mantendo a interface com o usuário simples e eficiente.
In a solid modeler, one of the most powerful tools to create threedimensional objects with any level of geometric complexity is the application of the Boolean set operations. They are intuitive and popular ways to combine solids, based on the operations applied to sets. The main types of Boolean operations commonly applied to solids are: union, intersection and difference. If there is practical interest, in order to assure that the resulting objects have the same dimension of the original objects, without loose or dangling parts, the regularization process is applied. To regularize means to restrict the result in a way that only filling volumes are allowed. In practice, the regularization is performed classifying the topological elements and removing the lower dimensional structures. The objective of this work is the development of a generic algorithm that allows the application of the Boolean set operations in a geometric modeling environment applied to finite element analysis, which aggregates the following functionalities: working with an undefined number of topological entities (Group concept), working with objects of different dimensions, working with nonmanifold objects, working with objects not necessarily plane or polyhedrical and assuring the efficiency, robustness and applicability in any modeling environment based on B-Rep representation. In this context, the implementation of the algorithm in a pre-existing geometric modeler named MG is presented, using the concept of object oriented programming and keeping the user interface simple and efficient.
APA, Harvard, Vancouver, ISO, and other styles
2

VELAYUTHAM, PRAKASH SANKAREN. "AN EFFICIENT ALGORITHM FOR CONVERTING POLYHEDRAL OBJECTS WITH WINGED-EDGE DATA STRUCTURE TO OCTREE DATA STRUCTURE." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1109366602.

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

Sathua, Chandra Sekhar. "Multi-linear Disassembly Path Determination: A Geometric Approach." Thesis, 2022. https://etd.iisc.ac.in/handle/2005/5859.

Full text
Abstract:
This thesis presents a geometric approach for determining the orientation-preserving disassembly paths of polyhedral assembly components. Exact disassembly path determination of the components is essential because the reversal of the disassembly paths provides the paths for the components to assemble into a functional product. Single straight-line paths for disassembly algorithms are available in the literature. Multilinear disassembly requires the determination of the exact Minkowski sum. Minkowski sum approaches, which are related to configuration space, have been used in path planning in both robotics and assembly. But they fail when the assembly components have mating boundaries. This limitation arises due to the failure to capture the contact spaces between the mating boundaries in the Minkowski sum. We have used non-regularized Boolean to capture these contact spaces in the form of lower-dimensional features, which are usually eliminated in regularized Boolean. These lower-dimensional features are characterized into different path elements, which provide the local motion space for a component to move in configuration space. The composition of these path elements models the disassembly paths. To accomplish this board goal, a few sub-problems have been solved. The Minkowski sum of a pair of arbitrary solids requires both Boolean and convex decomposition, which is then used to determine the disassembly paths for a component of an assembly. To achieve the broad objective of the thesis, the following contributions are made: (a) An algorithm has been developed for Boolean of a large number of polyhedral solids. It is based on cell classification without a priori point classification using Slice representation. Contact spaces are accurately captured as lower dimensional features, which is the requirement of the present problem, making it a non-regularized Boolean. Although the method obviates the need for complete boundary evaluation, it can provide exact point classification, which is as accurate as B-rep and as fast as voxel representation of solids. (b) The slice representation not only enables easy multi-Boolean. It also enables a “core and crust" model to partition a tessellated solid with an arbitrary topology into a set of disjoint convex pieces. The core comprises a set of prismatic solids of identical square sections contained in the solid and represents an approximate convex decomposition (ACD). The crust comprises a set of convex solids of arbitrary form and supplements the (ACD) to make it exact. It is fast and robust to handle defective solids such as solids with missing patches and self intersections. It also provides a unique capability of selective convex decomposition of any specific domain of interest. (c) Efficient and exact union of the hundreds of pairwise Minkowski sums of the combination of the convex components is enabled through the slice representation without the loss of the essential lower-dimensional features. A graph of the available motion space in individual grid-cells in the slice representation is then analysed to construct all the paths with heterogeneous degrees of freedom. i.e. each disassembly path is multilinear, multiway and multi-dimensional. (d) The method developed for disassembling two components is shown to be general enough for analysis of assemblies with an arbitrary number of components where each target sub-assembly and its complement are treated as the two components.
APA, Harvard, Vancouver, ISO, and other styles
4

Biswas, Arpan. "Segmentation And Parameter Assignment In Constructing Continuous Model From Discrete Representation." Thesis, 1997. https://etd.iisc.ac.in/handle/2005/1764.

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

Biswas, Arpan. "Segmentation And Parameter Assignment In Constructing Continuous Model From Discrete Representation." Thesis, 1997. http://etd.iisc.ernet.in/handle/2005/1764.

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

(9435722), Pavankumar Vaitheeswaran. "Interface Balance Laws, Growth Conditions and Explicit Interface Modeling Using Algebraic Level Sets for Multiphase Solids with Inhomogeneous Surface Stress." Thesis, 2020.

Find full text
Abstract:
Interface balance laws are derived to describe transport across a phase interface. This is used to derive generalized conditions for phase nucleation and growth, valid even for solids with inhomogeneous surface stress.

An explicit interface tracking approach called Enriched Isogeometric Analysis (EIGA) is used to simulate phase evolution. Algebraic level sets are used as a measure of distance and for point projection, both necessary operations in EIGA. Algebraic level sets are observed to often fail for surfaces. Rectification measures are developed to make algebraic level sets more robust and applicable for general surfaces. The proposed methods are demonstrated on electromigration problems. The simulations are validated by modeling electromigration experiments conducted on Cu-TiN line structures.

To model topological changes, common in phase evolution problems, Boolean operations are performed on the algebraic level sets using R-functions. This is demonstrated on electromigration simulations on solids with multiple voids, and on a bubble coalescence problem.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Boolean of Polyhedral Solids"

1

Toriya, H., T. Takamura, T. Satoh, and H. Chiyokura. "Boolean Operations of Solids with Free-From Surfarces Through Polyhedral Approximation." In New Advances in Computer Graphics, 405–20. Tokyo: Springer Japan, 1989. http://dx.doi.org/10.1007/978-4-431-68093-2_26.

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

Ayala, D., P. Brunet, R. Joan-Arinyo, and I. Navazo. "Multiresolution Approximation of Polyhedral Solids." In CAD Systems Development, 327–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60718-9_23.

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

Andújar, Carlos, Dolors Ayala, and Pere Brunet. "Validity-Preserving Simplification of Very Complex Polyhedral Solids." In Eurographics, 1–10. Vienna: Springer Vienna, 1999. http://dx.doi.org/10.1007/978-3-7091-6805-9_1.

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

Satoh, T., T. Takamura, H. Toriya, and H. Chiyokura. "Boolean Operations on Solids Bounded by a Variety of Surfaces." In Modeling in Computer Graphics, 141–54. Tokyo: Springer Japan, 1991. http://dx.doi.org/10.1007/978-4-431-68147-2_9.

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

Priyakumari, Chakkingal P., and Eluvathingal D. Jemmis. "Electron-Counting Rules in Cluster Bonding - Polyhedral Boranes, Elemental Boron, and Boron-Rich Solids." In The Chemical Bond, 113–48. Weinheim, Germany: Wiley-VCH Verlag GmbH & Co. KGaA, 2014. http://dx.doi.org/10.1002/9783527664658.ch5.

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

"Boolean Operations and Composite Solids." In Modelling with AutoCAD 2000, 210–13. Routledge, 2012. http://dx.doi.org/10.4324/9780080511887-34.

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

McFarlane, Bob. "Boolean operations and composite solids." In Modelling with Autocad 2004, 217–20. Elsevier, 2004. http://dx.doi.org/10.1016/b978-0-7506-6433-2.50034-7.

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

McFarlane, Bob. "Boolean operations and composite solids." In Modelling with Autocad 2002, 205–8. Elsevier, 2002. http://dx.doi.org/10.1016/b978-0-08-051189-4.50035-2.

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

Conference papers on the topic "Boolean of Polyhedral Solids"

1

Rashid, Mark M., Mili Selimotic, and Tarig Dinar. "General Polyhedral Finite Elements for Rapid Nonlinear Analysis." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49248.

Full text
Abstract:
An analysis system for solid mechanics applications is described in which a new finite element method that can accommodate general polyhedral elements is exploited. The essence of the method is direct polynomial approximation of the shape functions on the physical element, without transformation to a canonical element. The main motive is elimination of the requirement that all elements be similar to a canonical element via the usual isoparametric mapping. It is this topological restriction that largely drives the design of mesh-generation algorithms, and ultimately leads to the considerable human effort required to perform complex analyses. An integrated analysis system is described in which the flexibility of the polyhedral element method is leveraged via a robust computational geometry processor. The role of the latter is to perform rapid Boolean intersection operations between hex meshes and surface representations of the body to be analyzed. A typical procedure is to create a space-filling structured hex mesh that contains the body, and then extract a polyhedral mesh of the body by intersecting the hex mesh and the body’s surface. The result is a mesh that is directly usable in the polyhedral finite element method. Some example applications are: 1) simulation on very complex geometries; 2) rapid geometry modification and re-analysis; and 3) analysis of material-removal process steps following deformation processing. This last class of problems is particularly challenging for the conventional FE methodology, because the element boundaries are, in general, not aligned with the cutting geometry following the deformation (e.g. forging) step.
APA, Harvard, Vancouver, ISO, and other styles
2

Bao, Zhuojun. "Extended Bintrees for Representing the Spatial Decomposition of 3D Objects." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8683.

Full text
Abstract:
Abstract Extended bintree as a new class of approximation models for solid modeling is presented in this paper. Based on the bintree data structure, it allows face, edge and vertex node types as well as the classical black, white and grey nodes. Using extended bintrees, Boolean operations can be carried out and are used to generate a new object representation. The required memory is less than that in term of bintree, that is a generalization of the quadtree and octree. This gives a new efficient way to represent polygonal and polyhedral objects exactly. The extended bintree is a general method of binary cellular models. From that, the corresponding other binary models can be easily deduced. The extended bintree representation can be used in image processing and model converting in CAD/CAM systems.
APA, Harvard, Vancouver, ISO, and other styles
3

Daniels, Joel, Elaine Cohen, and David Johnson. "Converting Molecular Meshes Into Smooth Interpolatory Spline Solid Models." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-85363.

Full text
Abstract:
The study and understanding of molecules, once the domain of blackboards and stick-and-ball models, has become more and more exclusively linked to the use of computer-aided visualizations. Our project seeks to return the physical facsimile to the biologists, allowing the use of tactile senses while interacting with and manipulating a physical model, thus aiding educational and research endeavors. To increase the effectiveness of such a tool, the model is constructed such that multiple levels of information are viewable within the single physical form, stressing the interaction between the assorted components within the molecule. We use the term 3-D physical visualizations to refer to the fabricated model, to avoid confusion with the common usage of model as a virtual representation on the computer. To effectively combine multiple components into a smooth manufacturable physical visualization, all components of the model must be in a homogeneous format. Our research sets forth a method for converting triangulated mesh data, as provided by the molecular modeling packages, into spline models. Spline models have the attractive qualities that they are smooth without triangular facets, can be combined using traditional boolean operations (and, or, not), and can be directly fabricated using modern CAD/CAM techniques. Our method divides the polyhedral representation into multiple rectangular grids, then fits interpolatory spline surfaces to the data in each region, while focusing on smoothly stitching the boundaries and corners of the spline surfaces in order to create a near G1 continuous model.
APA, Harvard, Vancouver, ISO, and other styles
4

Shuai Zheng, Jun Hong, and Kang Jia. "Boolean operations on triangulated solids." In 2013 IEEE International Symposium on Assembly and Manufacturing (ISAM). IEEE, 2013. http://dx.doi.org/10.1109/isam.2013.6643476.

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

Biermann, Henning, Daniel Kristjansson, and Denis Zorin. "Approximate Boolean operations on free-form solids." In the 28th annual conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/383259.383280.

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

Adams, Bart, and Philip Dutré. "Interactive boolean operations on surfel-bounded solids." In ACM SIGGRAPH 2003 Papers. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/1201775.882320.

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

Zhang, B., L. Deng, P. Liu, W. Wang, and X. Wang. "Particle Tracking Optimization for Boolean Solids in JCOGIN." In 2020 ANS Virtual Winter Meeting. AMNS, 2020. http://dx.doi.org/10.13182/t123-33341.

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

Srinivas, Y. L., and Debasish Dutta. "A Solution to the Missing-View Problem for Polyhedral Solids." In ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0126.

Full text
Abstract:
Abstract An algorithm for generating the missing view corresponding to a given pair of orthoghonal views of a polyhedral solid is presented. The solution involves reconstructing the solids from the partial information given and then generating the missing view. The input is a vertex connectivity matrix describing the given views. Reconstruction of solids from incomplete orthographic views will have applications in computer-aided design, machine vision and automated inspection systems.
APA, Harvard, Vancouver, ISO, and other styles
9

Menon, Sreekumar, and Yong Se Kim. "Handling Blending Features in Form Feature Recognition Using Convex Decomposition." 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-0390.

Full text
Abstract:
Abstract Form features intrinsic to the product shape can be recognized using a convex decomposition called Alternating Sum of Volumes with Partitioning (ASVP). However, the domain of geometric objects to which ASVP decomposition can be applied had been limited to polyhedral solids due to the difficulty of convex hull construction for solids with curved boundary faces. We develop an approach to extend the geometric domain to solids having cylindrical and blending features. Blending surfaces are identified and removed from the boundary representation of the solid, and a polyhedral model of the unblended solid is generated while storing the cylindrical geometric information. From the ASVP decomposition of the polyhedral model, polyhedral form features are recognized. Form feature decomposition of the original solid is then obtained by reattaching the stored blending and cylindrical information to the form feature components of its polyhedral model. In this way, a larger domain of solids can be covered by the feature recognition method using ASVP decomposition. In this paper, handling of blending features in this approach is described.
APA, Harvard, Vancouver, ISO, and other styles
10

Hubbard, Carol, and Yong Se Kim. "Geometric Assistance for the Construction of Non-Polyhedral Solids From Orthographic Views." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/cie-4288.

Full text
Abstract:
Abstract As the extensive use of solid models becomes widespread, it is important to have a mechanism by which existing engineering drawings can be converted into solid models. Therefore, a geometric assistant which can aid in the construction of solid models is beneficial. In this paper, we present key operations for a system called the Assistant for the Rapid Construction of Solids (ARCS), that provides this assistance given a set of two orthographic views. ARCS is based on the Visual Reasoning Tutor (VRT), a system we developed that provides users with the geometric framework to build polyhedral solids from their orthographic views. However, the geometric domain of ARCS encompasses non-polyhedral solids with cylindrical and spherical surfaces, such as those found in typical mechanical parts. We have devised the Cylindrical and Spherical Warping operations to create cylindrical and spherical surfaces, which use interactive computer graphics that guide a human user to build non-polyhedral faces of a solid. These operations are then illustrated with an example using ARCS to create the solid model of a typical mechanical part from its orthographic projections.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Boolean of Polyhedral Solids' for particular source types:
Journal articles
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