Results 1  10
of
334,380
Dictionary of protein secondary structure: pattern recognition of hydrogenbonded and geometrical features
, 1983
"... For a successful analysis of the relation between amino acid sequence and protein structure, an unambiguous and physically meaningful definition of secondary structure is essential. We have developed a set of simple and physically motivated criteria for secondary structure, programmed as a patternr ..."
Abstract

Cited by 2096 (5 self)
 Add to MetaCart
. ” Geometric structure is defined in terms of the concepts torsion and curvature of differential geometry. Local chain “chirality ” is the torsional handedness of four consecutive Ca positions and is positive for righthanded helices and negative for ideal twisted @sheets. Curved pieces are defined as “bends
A finitevolume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.
 J. Geophys. Res.,
, 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract

Cited by 293 (32 self)
 Add to MetaCart
is used which is solved as a Poisson equation for the pressure field with Neumann boundary conditions in a geometry as complicated as that of the ocean basins. A major objective of the study is to make this inversion, and hence nonhydrostatic ocean modeling, efficient on parallel computers. The pressure
Algebraic Algorithms for Sampling from Conditional Distributions
 Annals of Statistics
, 1995
"... We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include generating tables with fixed row and column sums and higher dimensional analogs. The algorithms involve finding bases for associated polynomial ideals and so a ..."
Abstract

Cited by 268 (20 self)
 Add to MetaCart
an excursion into computational algebraic geometry.
Computational Geometry Column 38
, 2000
"... Recent results on curve reconstruction are described. Reconstruction of a curve from sample points ("connectthedots") is an important problem studied now for twenty years. Early efforts, primarily by researchers in computer vision, pattern recognition, and computational morphology, reli ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Recent results on curve reconstruction are described. Reconstruction of a curve from sample points ("connectthedots") is an important problem studied now for twenty years. Early efforts, primarily by researchers in computer vision, pattern recognition, and computational morphology
Computational Geometry Column 39
, 1993
"... The resolution of a decadesold open problem is described: polygonal chains cannot lock in the plane. A polygonal chain is a connected series of line segments. Chains may be open, or closed to form a polygon. A simple chain is one that does not selfintersect: only segments adjacent in the chain in ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The resolution of a decadesold open problem is described: polygonal chains cannot lock in the plane. A polygonal chain is a connected series of line segments. Chains may be open, or closed to form a polygon. A simple chain is one that does not selfintersect: only segments adjacent in the chain intersect, and then only at their shared endpoint. If the segments of a polygonal chain are viewed as rigid bars, and the vertices as universal joints, natural questions are whether every open chain can be straightenedreconfigured to lie on a straight lineand whether every closed chain can be convexifiedreconfigured to form a planar convex polygon. In both cases, the chains are to remain simple throughout the motion. If a chain cannot be so reconfigured, it is called locked. These questions were raised by several researchers independently since the 1970's, 1 and were the subject of intense investigation by the late 1990's. It was first established that chains can lock in three dime...
Computational Geometry Column 29
, 1993
"... , 1993. [Sha94] M. Sharir. Almost tight upper bounds for lower envelopes in higher dimensions. Discrete Comput. Geom., 12:327345, 1994. [SS83] J. T. Schwartz and M. Sharir. On the "piano movers" problem II: general techniques for computing topological properties of real algebraic manifol ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, 1993. [Sha94] M. Sharir. Almost tight upper bounds for lower envelopes in higher dimensions. Discrete Comput. Geom., 12:327345, 1994. [SS83] J. T. Schwartz and M. Sharir. On the "piano movers" problem II: general techniques for computing topological properties of real algebraic
Computational Geometry Column 52
"... [Draft, January 27, 2012.] Two artgallerylike problems of transmitters in xxx polygons are described, and several open problems posed. I have decided this will be my final Computational Geometry Column. It seems not inappropriate to return to my focus at the time I was writing Column #1: art galle ..."
Abstract
 Add to MetaCart
[Draft, January 27, 2012.] Two artgallerylike problems of transmitters in xxx polygons are described, and several open problems posed. I have decided this will be my final Computational Geometry Column. It seems not inappropriate to return to my focus at the time I was writing Column #1: art
Computational Geometry Column 58
 SIGACT News
"... This column is devoted to opaque sets also known as barriers. A set of curves Γ that meet every line which intersects a given convex body B is called an opaque set or barrier for B. Although the shape and length of shortest barriers for simple bodies, such as a unit equilateral triangle or a unit sq ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This column is devoted to opaque sets also known as barriers. A set of curves Γ that meet every line which intersects a given convex body B is called an opaque set or barrier for B. Although the shape and length of shortest barriers for simple bodies, such as a unit equilateral triangle or a unit
Computational Geometry Column 60
, 2014
"... This column is devoted to maximal empty axisparallel rectangles amidst a point set. In particular, among these, maximumarea rectangles are of interest. ..."
Abstract
 Add to MetaCart
This column is devoted to maximal empty axisparallel rectangles amidst a point set. In particular, among these, maximumarea rectangles are of interest.
Computational Geometry Column 33
, 1998
"... Several recent SIGGRAPH papers on surface simplification are described. Keywords: Mesh simplification, decimation. The stringent demands of realtime graphics have engendered a need for simplification of object models. Here several papers on aspects of the problem for 3D polygonal models are descr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Several recent SIGGRAPH papers on surface simplification are described. Keywords: Mesh simplification, decimation. The stringent demands of realtime graphics have engendered a need for simplification of object models. Here several papers on aspects of the problem for 3D polygonal models are described at a high level. 1. Levels of Detail A consensus may be emerging in favor of the representation of complex models as a single, hierarchical data structure that represents many levels of detail simultaneously, from the simplified root to the fully detailed leaves. The hierarchy is known under various names: vertex tree, 7 merge tree, 9 vertex hierarchy, 6 progressive mesh, 5 progressive simplicial complex. 8 We will use vertex tree here to refer to the generic concept. Typically the tree is binary, with each node represting a vertex of some simplification of the original model. The two children vertices v 1 and v 2 of their parent v are merged (or identified, or unified, or ...
Results 1  10
of
334,380