Search results for "curves"
showing 10 items of 152 documents
The effect of geometrical parameters on the discharge capacity of meandering compound channels
2008
A number of methods and formulae has been proposed in the literature to estimate the discharge capacity of compound channels. When the main channel has a meandering pattern, a reduction in the conveyance capacity for a given stage is observed, which is due to the energy dissipations caused by the development of strong secondary currents and to the decrease of the main channel bed slope with respect to the valley bed slope. The discharges in meandering compound channels are usually assessed applying, with some adjustments, the same methods used in the straight compound channels. Specifically, the sinuosity of the main channel is frequently introduced to account for its meandering pattern, al…
Separation properties of continuous maps in codimension 1 and geometrical applications
1992
Abstract Nuno Ballesteros, J.J. and M.C. Romero Fuster, Separation properties of continuous maps in codimension 1 and geometrical applications, Topology and its Applications 46 (1992) 107-111. We show that the image of a proper closed continuous map, f , from an n -manifold X to an ( n + 1)-manifold Y , such that H 1 (Y; Z 2 ) =0 , separates Y into at least two connected components provided the self-intersections set of f is not dense in any connected component of Y . We also obtain some geometrical applications.
On the number of singularities, zero curvature points and vertices of a simple convex space curve
1995
We prove a generalization of the 4 vertex theorem forC3 closed simple convex space curves including singular and zero curvature points.
Convexly generic curves in R 3
1988
We study curves immersed in R 3, with special interest in the description of their convex hull frontier structure from a global viewpoint. Genericity conditions are set for these curves by looking at the singularities of height functions on them. We define panel structures for convexly generic curves and work out numerical relations involving the number of tritangent support planes. As a consequence, a generic version of the 4-vertex theorem for convex curves in R 3 is obtained.
Estudio climático del exponente “n” de las curvas IDF: aplicación para la Península Ibérica
2009
El análisis de las precipitaciones máximas suele llevarse a cabo mediante curvas IDF (Intensidad-Duración-Frecuencia), que a su vez pueden expresarse como curvas IMM (Intensidades Medias Máximas). En este trabajo, hemos desarrollado un índice “n”, definido a partir del exponente que se obtiene de ajustar las curvas climáticas IDF a las curvas IMM. Dicho índice proporciona información sobre el modo en que se alcanzan las precipitaciones máximas en una determinada zona clim´atica, atendiendo a la distribuci´on temporal relativa de las intensidades m´aximas. A partir del an´alisis clim´atico del ´ındice “n”, en la Pen´ınsula Ib´erica se pueden distinguir grandes zonas caracterizadas por m´axim…
Photometric and Spectroscopic Properties of Type Ia Supernova 2018oh with Early Excess Emission from the $Kepler$ 2 Observations
2019
Supernova (SN) 2018oh (ASASSN-18bt) is the first spectroscopically-confirmed type Ia supernova (SN Ia) observed in the $Kepler$ field. The $Kepler$ data revealed an excess emission in its early light curve, allowing to place interesting constraints on its progenitor system (Dimitriadis et al. 2018, Shappee et al. 2018b). Here, we present extensive optical, ultraviolet, and near-infrared photometry, as well as dense sampling of optical spectra, for this object. SN 2018oh is relatively normal in its photometric evolution, with a rise time of 18.3$\pm$0.3 days and $\Delta$m$_{15}(B)=0.96\pm$0.03 mag, but it seems to have bluer $B - V$ colors. We construct the "uvoir" bolometric light curve hav…
Space-Time FPCA Clustering of Multidimensional Curves.
2018
In this paper we focus on finding clusters of multidimensional curves with spatio-temporal structure, applying a variant of a k-means algorithm based on the principal component rotation of data. The main advantage of this approach is to combine the clustering functional analysis of the multidimensional data, with smoothing methods based on generalized additive models, that cope with both the spatial and the temporal variability, and with functional principal components that takes into account the dependency between the curves.
Depth-based methods for clustering of functional data.
2017
The problem of detecting clusters is a common issue in the analysis of functional data and some interesting intuitions from approaches relied on depth measures can be considered for construction of basic tools for clustering of curves. Motivated by recent contributions on the problem clustering and alignment of functional data, we also consider the problem of aligning a set of curves when classification procedures are implemented. The variability among curves can be interpreted in terms of two components, phase and amplitude; phase variability, or misalignment, can be eliminated by aligning the curves, according to a similarity index and a warping function. Some approaches address the misal…
Exact, efficient, and complete arrangement computation for cubic curves
2006
AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
2005
We present the first exact, complete and efficient implementation that computes for a given set P=p1,...,pn of quadric surfaces the planar map induced by all intersection curves p1∩ pi, 2 ≤ i ≤ n, running on the surface of p1. The vertices in this graph are the singular and x-extreme points of the curves as well as all intersection points of pairs of curves. Two vertices are connected by an edge if the underlying points are connected by a branch of one of the curves. Our work is based on and extends ideas developed in [20] and [9].Our implementation is complete in the sense that it can handle all kind of inputs including all degenerate ones where intersection curves have singularities or pa…