Synthesis of Solid Models of Polyhedra from their Orthogonal Views using Logical Representations

نویسندگان

  • Gabriela Garza
  • Luis Pineda
چکیده

In this paper a representational language of a logical kind which is expressive enough to model concepts of descriptive geometry is presented. The language is employed to produce solid models of polyhedra from representations of their orthogonal projections. The synthetic process has as its input well-formed expressions representing the geometrical entities and relations of bidimensional orthogonal views and employs expressions representing drafting concepts of descriptive geometry to produce expressions denoting the 3D objects contituting the final polyhedra. The production of 3D models of solid objects from their orthogonal views has a significant history within computer graphics and CAD. Most previous approaches are based on numerical algorithms modeling geometrical and topological constraints of the problem domain in a quantitative fashion. However, in this approach, geometrical objects are referred to through expressions of a declarative language, and the final object is produced through symbolic inference.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling Decision Problems Via Birkhoff Polyhedra

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

متن کامل

Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)

The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature recognition, among others. The obtained CSG tree has convex primitives at its leaf nodes, while the contents of its internal nodes alternate between the setunion and set-difference operators. This paper first shows th...

متن کامل

The Discretized Polyhedra Simpli cation ( DPS ) : a Framework for Polyhedra

Automatic simpliication of polyhedral objects is a major topic in many computer graphics applications. This work discusses simpliication algorithms for the generation of a multiresolution family of solid representations from an initial polyhedral solid. We introduce the Discretized Polyhedra Simpliication (DPS), a framework for polyhedra simpliication using space decomposition models. The DPS i...

متن کامل

On local gamma factors for orthogonal groups and unitary groups

‎In this paper‎, ‎we find a relation between the proportionality factors which arise from the functional equations of two families of local Rankin-Selberg convolutions for‎ ‎irreducible admissible representations of orthogonal groups‎, ‎or unitary groups‎. ‎One family is that of local integrals of the doubling method‎, ‎and the other family is‎ ‎that of local integrals expressed in terms of sph...

متن کامل

Link Propagation Across Variability Representations with Isabelle / HOL

When dealing with highly complex product lines it is usually indispensable to somehow subdivide the overall product line into several smaller, subordinate product lines and to define orthogonal views on the line’s variability tailored to particular purposes, such as end-customer configuration. In this article we report on an ongoing research effort for dealing with feature links, i.e. logical c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998