A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Identifying and re-meshing contact interfaces in a polyhedral assembly for digital mock-up
2006
Engineering with Computers
Finally, a precise detection of the faces involved in each contact area is made and the resulting input domains identified are processed using a local Frontal Delaunay re-meshing technique to produce an ...
interfaces in a polyhedral assembly for digital mock-up applications -Engineering With Abstract Polyhedral models are widely used for applications such as manufacturing, digital simulation or visualization ...
For planar contact areas the inserted edges are simply projected on the facing contact area. For non-planar contact areas edges are inserted with mean curvature checking. ...
doi:10.1007/s00366-006-0029-7
fatcat:obtnbeyxp5ha3gjxdnigylbfzq
Geometrically accurate, efficient, and flexible quadrature techniques for the tetrahedral finite cell method
2016
Computer Methods in Applied Mechanics and Engineering
We illustrate the importance of geometrically accurate volume quadrature for obtaining optimal accuracy with non-boundary-fitted finite element discretizations, when the problem domain is defined by sharp ...
The elementwise parametrization procedure relies on the identification of the intersection topology and a series of higher-order mappings based on Lagrange polynomials. ...
The Minnesota group gratefully acknowledges support from the National Science Foundation (CISE-1565997) and the In- ...
doi:10.1016/j.cma.2016.07.041
fatcat:pcmhdsxn2rehjhozzbjzrstfha
Inter-surface mapping
2004
ACM SIGGRAPH 2004 Papers on - SIGGRAPH '04
In these settings, we obtain better parametrizations than with previous specialized techniques, thanks to our fine-grain optimization. ...
Inter-surface mapping is shown using geometric and attribute morphs. ...
We thank Cyberware and the Digital M Stanford University for the 3D models, and Andrei Khodakovsky for sharing his Globally Smooth Parametrization data. ...
doi:10.1145/1186562.1015812
fatcat:e7itjy3o6vcrll5i55jzucyqce
Inter-surface mapping
2004
ACM Transactions on Graphics
In these settings, we obtain better parametrizations than with previous specialized techniques, thanks to our fine-grain optimization. ...
Inter-surface mapping is shown using geometric and attribute morphs. ...
We thank Cyberware and the Digital M Stanford University for the 3D models, and Andrei Khodakovsky for sharing his Globally Smooth Parametrization data. ...
doi:10.1145/1015706.1015812
fatcat:jznmfb5b6jcqfjcedc23rjsaqu
An update on automatic 3D building reconstruction
2010
ISPRS journal of photogrammetry and remote sensing (Print)
The development of tools for the generation of 3D city models started almost two decades ago. ...
In addition to these developments, the paper will also review current approaches for the generation of more detailed facade geometries from terrestrial data collection. ...
Acknowledgement Martin Kada is indebted to the Baden-Württemberg Stiftung for the financial support of this research project by the Eliteprogramme for Postdocs. ...
doi:10.1016/j.isprsjprs.2010.09.006
fatcat:3b2n7gg3nvfixphw4no33cjjqa
Designing with Parametric CAD: Classification and comparison of construction techniques
[chapter]
2001
Geometric Modelling
An enumeration of parametric capabilities for model creation in current commercial CAD systems is reviewed. ...
The discussion in this paper is a generalization of parametric capabilities of commercial systems; prototypes in academic research labs are not discussed. F. Kimura (ed.), Geometric Modelling ...
The underlying technology for parametrics is constraint solving. In the context of geometric modeling, constraints result in non-linear simultaneous algebraic equations. ...
doi:10.1007/978-0-387-35490-3_4
fatcat:iu73ddxasbgybcy4ti6utx3tlm
Reconstruction of curved solids from engineering drawings
2001
Computer-Aided Design
Next, a maximum turning angle method is developed to ®nd all the candidate faces in the wire-frame model. ...
Finally, a general and ef®cient searching technique is proposed for ®nding valid solids from the candidate faces; the technique greatly reduces the searching space and the backtracking incidents. ...
We would like to thank Dr Chiew-Lan Tai for many helpful suggestions and careful reading and constructive criticism. ...
doi:10.1016/s0010-4485(00)00143-3
fatcat:nti32b237ngsdbvkzsipmw2nay
Feature-based 3D morphing based on geometrically constrained spherical parameterization
2012
Computer Aided Geometric Design
Current trends in free form editing motivate the development of a novel editing paradigm for CAD models beyond traditional CAD editing of mechanical parts. ...
In this paper, we present a feature-based approach to 3D morphing of arbitrary genus-0 polyhedral objects that is appropriate for CAD editing. ...
This process requires each projected edge of one model to be intersected with each projected edge of the other. ...
doi:10.1016/j.cagd.2011.09.004
fatcat:wvoxppuoqzhvde24nfp2oopnnq
Graph-Theoretic Solutions to Computational Geometry Problems
[chapter]
2010
Lecture Notes in Computer Science
Math. 1996]
Modeling bends by flow
The tiling formed from Ageev's arrangement Result is a squaregraph (planar, all faces quadrilaterals, all interior vertices have degree ≥ 4) that cannot be embedded ...
from star hub to leaf point in embedding = 1/2 (difference between distances from s to two vertices for that point) always non-negative because of upwards length-0 edge Add additional line segments to ...
many non-graph problems The graph algorithms used for these problems are often classical... maximum independent set and maximum clique maximum or perfect matching maximum or minimum-cost flow graph shortest ...
doi:10.1007/978-3-642-11409-0_1
fatcat:rqrljmkgqrb3ddw5nszva6ighi
Shape complexity
2005
The Visual Computer
Algebraic complexity measures the degree of polynomials needed to represent the shape exactly in its implicit or parametric form. ...
We discuss several complexity measures and the corresponding complexity reduction techniques. ...
In this parametric trimmed surface representation, each trimming edge is represented twice (once for each incident face). ...
doi:10.1007/s00371-005-0362-7
fatcat:kyz5qzyt75f5fkdfd3nhlacqkm
Graph-Theoretic Solutions to Computational Geometry Problems
[article]
2009
arXiv
pre-print
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. ...
Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. ...
Acknowledgements This work was supported in part by NSF grant 0830403 and by the Office of Naval Research under grant N00014-08-1-1015. ...
arXiv:0908.3916v1
fatcat:s4kizimp7jggliyivcqm5iokmm
Automatic reconstruction of as-built building information models from laser-scanned point clouds: A review of related techniques
2010
Automation in Construction
We sub-divide the overall process into three core operations: geometric modeling, object recognition, and object relationship modeling. ...
This article surveys techniques developed in civil engineering and computer science that can be utilized to automate the process of creating as-built BIMs. ...
The derived relationships include adjacency, containment, separation, intersection, face-face intersection, face-edge intersection, common edge intersection, and connectivity. ...
doi:10.1016/j.autcon.2010.06.007
fatcat:w24xys5gtfc23aftwjrjwacldm
Shape transformation for polyhedral objects
1992
Proceedings of the 19th annual conference on Computer graphics and interactive techniques - SIGGRAPH '92
This paper presents an algorithm for computing such transformations. The algorithm merges the topological structures of a pair of 3D polyhedral models into a common vertex/edgeJface network. ...
Techniques that transform one two-dimensionaf image into another have gained widespread use m recent yeara. ...
Rephael Wenger, Kevin Rodger~Steve May, and Stephen Spencer for useful i&ss and criticism, and Rofessor Charles Csuri for the use of his head. ...
doi:10.1145/133994.134007
dblp:conf/siggraph/KentCP92
fatcat:zwg7srd6qzgyncgbfwjyirmtum
Shape transformation for polyhedral objects
1992
Computer graphics
This paper presents an algorithm for computing such transformations. The algorithm merges the topological structures of a pair of 3D polyhedral models into a common vertex/edgeJface network. ...
Techniques that transform one two-dimensionaf image into another have gained widespread use m recent yeara. ...
Rephael Wenger, Kevin Rodger~Steve May, and Stephen Spencer for useful i&ss and criticism, and Rofessor Charles Csuri for the use of his head. ...
doi:10.1145/142920.134007
fatcat:suxwvgkgmveufdak46ueo6f6nm
Splines and geometric modeling
[chapter]
2004
Handbook of Discrete and Computational Geometry, Second Edition
For non-convex facets and edges a double-sided tetrahedra is built and for convex facets and edges single-sided tetrahedra are built. ...
Similar techniques exist for parametrics Pet91, F ar86, Sar87 however the geometric degree of the solution surfaces tend to be prohibitively high. ...
doi:10.1201/9781420035315.ch53
fatcat:e7evq2b77ba5lj3vxlcxwxxzda
« Previous
Showing results 1 — 15 out of 5,151 results