ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A constrained finite element method for modeling cloth deformation (1999)
    Springer
    The visual computer 15 (1999), S. 90-99 
    Details
    ISSN: 1432-2315
    Keywords: Key words: Cloth deformation ; Geometric constraint ; Geometric physical method ; Constrained finite element method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s003710050164
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Hierarchical structure to winged-edge structure: a conversion algorithm (1988)
    Springer
    The visual computer 4 (1988), S. 133-141 
    Details
    ISSN: 1432-2315
    Keywords: Winged-edge data structure ; Algorithm ; Solid modelling ; Boundary representation ; Constructive solid geometry ; Non-manifold faces ; Euler poincare formula ; Free-form surfaces
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The winged-edge data structure is advantageous for traversing the topological graph of the boundary representation of a solid object. This paper presents an algorithm for converting hierarchical boundary representations into representations in the winged-edge data structure. As a result of the conversion, the adjacency relationships of geometric entities embedded in hierarchical boundary representations,-which may be evaluated through boundary evaluation on solid objects defined via Boolean set-operations, can be easily and efficiently accessed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01908896
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Beiträge zur Dekomposition von linearen Programmen (1966)
    Springer
    Mathematical methods of operations research 10 (1966), S. 247-268 
    Details
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01967465
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Display techniques and boundary evaluation of a Sweep-CSG modeller (1991)
    Springer
    The visual computer 8 (1991), S. 18-34 
    Details
    ISSN: 1432-2315
    Keywords: Sweep-CSG ; Solid-sweep raytracing ; Boundary evaluation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Among the various techniques for displaying solid objects, ray tracing is the most popular method for sweep-generated objects, owing to its simplicity and effectiveness. The main problem in ray tracing is to find the point of intersection between the ray and the object. By taking consideration of the special features of a surface generated by sweep, the ray/object intersection problem can be reduced to 2-D planar problem. This paper presents a raycasting technique for displaying Sweep-CSG-represented solids. This technique works directly on the Sweep-CSG representation and does not require explicit boundary information. Boundary information is, however essential for line-drawing outputs. In this paper, boundary-evaluation techniques for obtaining edges of a Sweep-CSG solid are described. Special techniques for evaluating the boundaries of a solid generated by sweeping another solid are also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01900843
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A review of automatic dimensioning and tolerancing schemes (1994)
    Springer
    Engineering with computers 10 (1994), S. 63-80 
    Details
    ISSN: 1435-5663
    Keywords: Dimensioning ; Tolerancing ; Variational geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract Dimensioning and tolerancing are very important issues in product design and manufacture. This paper gives a survey and review of the current state-of-the-art solutions to the problem of finding a meaning for dimensions and tolerances. Dimensioning and tolerancing in current engineering practices and researches in these topics are also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01200178
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Trimming of free-form objects for a B-Rep solid modeller (1995)
    Springer
    Engineering with computers 11 (1995), S. 185-198 
    Details
    ISSN: 1435-5663
    Keywords: B-Rep ; solid modelling ; split-edge ; trimmed surfaces
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract This paper describes a technique for trimming solid objects in a B-Rep solid modelling system. A B-Rep scheme based on the split-edge structure, which is suitable for the representation of trimmed surfaces, is first discussed. Algorithms for graph traversal, graph merging and graph splitting are then given in detail. Based on this B-Rep scheme, a technique for trimming objects is developed. The trimming process involves the evaluation of surface intersections, graph cutting along intersections and merging of appropriate graphs to obtain the required trimmed objects.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01208813
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Parting line formation by slicing a 3D CAD model (1998)
    Springer
    Engineering with computers 14 (1998), S. 330-343 
    Details
    ISSN: 1435-5663
    Keywords: Parting line ; Slicing algorithm ; Undercut detection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract An effective computer-aided parting line/surface formation algorithm can increase the overall efficiency in the mould design and manufacturing processes. The presence of free-form surfaces in a product model imposes a burden on mould makers to determine the parting line and parting surfaces. Previously proposed algorithms, although available, are few, and mainly deal with product with planar or simple curved surfaces. A new algorithm, which adopts an uneven slicing on the product model, is proposed. The algorithm provides a quick and effective way to locate the parting line and parting surface of a free-form product model.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01201764
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Construction of a hybrid sweep-CSG modeler—The sweep-CSG representation (1992)
    Springer
    Engineering with computers 8 (1992), S. 101-119 
    Details
    ISSN: 1435-5663
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract Applying sweep operations on 2-D closed contours is a well known method for modelling 3-D solid objects. This paper deals with the implementation of a solid modeler with sweep as the basic representational scheme. In the modeler, a solid is defined by sweeping a planar polygon along a linear or curved trajectory. A sculptured solid may also be defined by using a beta-spline curve for the sweep polygon and a cubic B-spline curve for the sweep trajectory. By incorporating Boolean operations, a hybrid sweep-CSG solid modeler is implemented. The current implementation allows translational, rotational, and twisted sweep operations on a planar polygon composited of lines and arcs. In addition, a solid primitive can also be created by sweeping a planar closed beta-spline curve along a cubic B-spline curve.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01200106
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Necessary conditions for problems with higher derivative bounded state variables (1978)
    Springer
    Journal of optimization theory and applications 26 (1978), S. 601-636 
    Details
    ISSN: 1573-2878
    Keywords: Optimization ; calculus of variations ; state constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper combines the separate works of two authors. Tan proves a set of necessary conditions for a control problem with second-order state inequality constraints (see Ref. 1). Russak proves necessary conditions for an extended version of that problem. Specifically, the extended version augments the original problem by including state equality constraints, differential and isopermetric equality and inequality constraints, and endpoint constraints. In addition, Russak (i) relaxes the solvability assumption on the state constraints, (ii) extends the maximum principle to a larger set, (iii) obtains modified forms of the relationH =H t and of the transversality relation usually obtained in problems of this type, and (iv) proves a condition concerning μα(t 1), the derivative of the multiplier functions at the final time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00933154
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Beiträge zur Dekomposition von linearen Programmen (1966)
    Springer
    Mathematical methods of operations research 10 (1966), S. 168-189 
    Details
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary In this paper we are concerned with the decomposition methods ofDantzig/Wolfe, Abadie/Williams, Benders andRosen, particularly to show the relations among them. A new method, the “primal-dual decomposition method” is developed. FollowingCharnes/Cooper, “dyadic transformations” are used to solve various linear programs by decomposition. A survey of extensions and applications is also given.
    Notes: Zusammenfassung Das Ziel dieser Arbeit besteht vor allem darin, die Zusammenhänge der Dekompositionsmethoden für lineare Programme vonDantzig/Wolfe, Abadie/Williams, Benders, Rosen usw. aufzusuchen. In Kapitel I und III werden diese Methoden mehr oder weniger ausführlich behandelt. Für einige Sätze werden neue Beweise angegeben. In Kapitel II entwickeln wir eine neue Dekompositionsmethode, die aus der Kombination des primaldualen Verfahrens mit derDantzig/Wolfeschen Dekomposition entsteht. Der Idee vonCharnes/Cooper folgend benützen wir „dyadische Transformationen“ in Kapitel IV, um mehrstufige und Transportprobleme durch Dekomposition zu lösen. Schließlich werden in Kapitel V Überlicke über Anwendungen, Erweiterungen für nichtlineare Programmierung und einige Ausblicke gegeben.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01920940
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...