GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Association for Computing Machinery (ACM)  (7)
  • 1
    Online Resource
    Online Resource
    Sliver exudation
    Association for Computing Machinery (ACM) ; 2000
    In:  Journal of the ACM Vol. 47, No. 5 ( 2000-09), p. 883-904
    Details
    In: Journal of the ACM, Association for Computing Machinery (ACM), Vol. 47, No. 5 ( 2000-09), p. 883-904
    Abstract: A sliver is a tetrahedon whose four vertices lie close to a plane and whose orthogonal projection to that plane is a convex quadrilateral with no short edge. Slivers are notoriously common in 3-dimensional Delaunay triangulations even for well-spaced point sets. We show that, if the Delaunay triangulation has the ratio property introduced in Miller et al. [1995], then there is an assignment of weights so the weighted Delaunay traingulation contains no slivers. We also give an algorith m to compute such a weight assignment.
    Type of Medium: Online Resource
    ISSN: 0004-5411 , 1557-735X
    URL: Article
    DOI: 10.1145/355483.355487
    RVK:
    SA 3010
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2000
    detail.hit.zdb_id: 2006500-0
    detail.hit.zdb_id: 6759-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Computing elevation maxima by searching the gauss sphere
    Association for Computing Machinery (ACM) ; 2011
    In:  ACM Journal of Experimental Algorithmics Vol. 16 ( 2011-05)
    Details
    In: ACM Journal of Experimental Algorithmics, Association for Computing Machinery (ACM), Vol. 16 ( 2011-05)
    Abstract: The elevation function on a smoothly embedded 2-manifold in ℝ 3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in identifying coarse docking configurations for protein pairs. Transporting the concept from the smooth to the piecewise linear category, this article describes an algorithm for finding all local maxima. While its worst-case running time is the same as of the algorithm used in prior work, its performance in practice is orders of magnitudes superior. We cast light on this improvement by relating the running time to the total absolute Gaussian curvature of the 2-manifold.
    Type of Medium: Online Resource
    ISSN: 1084-6654 , 1084-6654
    URL: Article
    DOI: 10.1145/1963190.1970375
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2011
    detail.hit.zdb_id: 2006463-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Interface surfaces for protein-protein complexes
    Association for Computing Machinery (ACM) ; 2006
    In:  Journal of the ACM Vol. 53, No. 3 ( 2006-05), p. 361-378
    Details
    In: Journal of the ACM, Association for Computing Machinery (ACM), Vol. 53, No. 3 ( 2006-05), p. 361-378
    Abstract: Protein-protein interactions, which form the basis for most cellular processes, result in the formation of protein interfaces. Believing that the local shape of proteins is crucial, we take a geometric approach and present a definition of an interface surface formed by two or more proteins as a subset of their Voronoi diagram. The definition deals with the difficult and important problem of specifying interface boundaries by invoking methods used in the alpha shape representation of molecules, the discrete flow on Delaunay simplices to define pockets and reconstruct surfaces, and the assessment of the importance of topological features. We present an algorithm to construct the surface and define a hierarchy that distinguishes core and peripheral regions. This hierarchy is shown to have correlation with hot-spots in protein-protein interactions. Finally, we study the geometric and topological properties of interface surfaces and show their high degree of contortion.
    Type of Medium: Online Resource
    ISSN: 0004-5411 , 1557-735X
    URL: Article
    DOI: 10.1145/1147954.1147957
    RVK:
    SA 3010
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2006
    detail.hit.zdb_id: 2006500-0
    detail.hit.zdb_id: 6759-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    An optimal algorithm for intersecting line segments in the plane
    Association for Computing Machinery (ACM) ; 1992
    In:  Journal of the ACM Vol. 39, No. 1 ( 1992-01-02), p. 1-54
    Details
    In: Journal of the ACM, Association for Computing Machinery (ACM), Vol. 39, No. 1 ( 1992-01-02), p. 1-54
    Abstract: The main contribution of this work is an O ( n log n + k )-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.
    Type of Medium: Online Resource
    ISSN: 0004-5411 , 1557-735X
    URL: Article
    DOI: 10.1145/147508.147511
    RVK:
    SA 3010
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1992
    detail.hit.zdb_id: 2006500-0
    detail.hit.zdb_id: 6759-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 5
    Online Resource
    Online Resource
    Three-dimensional alpha shapes
    Association for Computing Machinery (ACM) ; 1994
    In:  ACM Transactions on Graphics Vol. 13, No. 1 ( 1994-01), p. 43-72
    Details
    In: ACM Transactions on Graphics, Association for Computing Machinery (ACM), Vol. 13, No. 1 ( 1994-01), p. 43-72
    Abstract: Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the “shape” of the set. For that purpose, this article introduces the formal notion of the family of α-shapes of a finite point set in R 3 . Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter α ε R controlling the desired level of detail. An algorithm is presented that constructs the entire family of shapes for a given set of size n in time 0(n 2 ) , worst case. A robust implementation of the algorithm is discussed, and several applications in the area of scientific computing are mentioned.
    Type of Medium: Online Resource
    ISSN: 0730-0301 , 1557-7368
    URL: Article
    DOI: 10.1145/174462.156635
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1994
    detail.hit.zdb_id: 2006336-2
    detail.hit.zdb_id: 625686-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 6
    Online Resource
    Online Resource
    Algorithmic issues in modeling motion
    Association for Computing Machinery (ACM) ; 2002
    In:  ACM Computing Surveys Vol. 34, No. 4 ( 2002-12), p. 550-572
    Details
    In: ACM Computing Surveys, Association for Computing Machinery (ACM), Vol. 34, No. 4 ( 2002-12), p. 550-572
    Abstract: This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory of motion representation that would be useful across several disciplines.
    Type of Medium: Online Resource
    ISSN: 0360-0300 , 1557-7341
    URL: Article
    DOI: 10.1145/592642.592647
    RVK:
    SA 2943
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2002
    detail.hit.zdb_id: 215909-0
    detail.hit.zdb_id: 1495309-2
    detail.hit.zdb_id: 626472-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 7
    Online Resource
    Online Resource
    Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
    Association for Computing Machinery (ACM) ; 1990
    In:  ACM Transactions on Graphics Vol. 9, No. 1 ( 1990-01-03), p. 66-104
    Details
    In: ACM Transactions on Graphics, Association for Computing Machinery (ACM), Vol. 9, No. 1 ( 1990-01-03), p. 66-104
    Abstract: This paper describes a general-purpose programming technique, called Simulation of Simplicity, that can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task of providing a consistent treatment for every single special case that can occur. The programs that use the technique tend to be considerably smaller and more robust than those that do not use it. We believe that this technique will become a standard tool in writing geometric software.
    Type of Medium: Online Resource
    ISSN: 0730-0301 , 1557-7368
    URL: Article
    DOI: 10.1145/77635.77639
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1990
    detail.hit.zdb_id: 2006336-2
    detail.hit.zdb_id: 625686-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...