103,090 research outputs found
Consistent Digital Curved Rays and Pseudoline Arrangements
Representing a family of geometric objects in the digital world where each object is represented by a set of pixels is a basic problem in graphics and computational geometry. One important criterion is the consistency, where the intersection pattern of the objects should be consistent with axioms of the Euclidean geometry, e.g., the intersection of two lines should be a single connected component. Previously, the set of linear rays and segments has been considered. In this paper, we extended this theory to families of curved rays going through the origin. We further consider some psudoline arrangements obtained as unions of such families of rays
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays
We consider the problem of digitalizing Euclidean segments. Specifically, we
look for a constructive method to connect any two points in . The
construction must be {\em consistent} (that is, satisfy the natural extension
of the Euclidean axioms) while resembling them as much as possible. Previous
work has shown asymptotically tight results in two dimensions with error, where resemblance between segments is measured with the Hausdorff
distance, and is the distance between the two points. This
construction was considered tight because of a lower bound
that applies to any consistent construction in .
In this paper we observe that the lower bound does not directly extend to
higher dimensions. We give an alternative argument showing that any consistent
construction in dimensions must have error. We
tie the error of a consistent construction in high dimensions to the error of
similar {\em weak} constructions in two dimensions (constructions for which
some points need not satisfy all the axioms). This not only opens the
possibility for having constructions with error in high dimensions,
but also opens up an interesting line of research in the tradeoff between the
number of axiom violations and the error of the construction. In order to show
our lower bound, we also consider a colored variation of the concept of
discrepancy of a set of points that we find of independent interest
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in Zd. The construction must be consistent (that is, satisfy the natural extension of the Euclidean axioms) while resembling them as much as possible. Previous work has shown asymptotically tight results in two dimensions with Θ(logN) error, where resemblance between segments is measured with the Hausdorff distance, and N is the L1 distance between the two points. This construction was considered tight because of a Ω(logN) lower bound that applies to any consistent construction in Z2. In this paper we observe that the lower bound does not directly extend to higher dimensions. We give an alternative argument showing that any consistent construction in d dimensions must have Ω(log1/(d−1)N) error. We tie the error of a consistent construction in high dimensions to the error of similar weak constructions in two dimensions (constructions for which some points need not satisfy all the axioms). This not only opens the possibility for having constructions with o(logN) error in high dimensions, but also opens up an interesting line of research in the tradeoff between the number of axiom violations and the error of the construction. A side result, that we find of independent interest, is the introduction of the bichromatic discrepancy: a natural extension of the concept of discrepancy of a set of points. In this paper, we define this concept and extend known results to the chromatic setting
High Quality Consistent Digital Curved Rays via Vector Field Rounding
We consider the consistent digital rays (CDR) of curved rays, which approximates a set of curved rays emanating from the origin by the set of rooted paths (called digital rays) of a spanning tree of a grid graph. Previously, a construction algorithm of CDR for diffused families of curved rays to attain an O(?{n log n}) bound for the distance between digital ray and the corresponding ray is known [Chun et al., 2019]. In this paper, we give a description of the problem as a rounding problem of the vector field generated from the ray family, and investigate the relation of the quality of CDR and the discrepancy of the range space generated from gradient curves of rays. Consequently, we show the existence of a CDR with an O(log ^{1.5} n) distance bound for any diffused family of curved rays
High Dimensional Consistent Digital Segments
We consider the problem of digitalizing Euclidean line segments from R^d to Z^d. Christ {et al.} (DCG, 2012) showed how to construct a set of {consistent digital segments} (CDS) for d=2: a collection of segments connecting any two points in Z^2 that satisfies the natural extension of the Euclidean axioms to Z^d. In this paper we study the construction of CDSs in higher dimensions.
We show that any total order can be used to create a set of {consistent digital rays} CDR in Z^d (a set of rays emanating from a fixed point p that satisfies the extension of the Euclidean axioms). We fully characterize for which total orders the construction holds and study their Hausdorff distance, which in particular positively answers the question posed by Christ {et al.}
Evidence of TeV gamma-ray emission from the nearby starburst galaxy NGC 253
TeV gamma-rays were recently detected from the nearby normal spiral galaxy
NGC 253 (Itoh et al., 2002). Observations to detect the Cherenkov light images
initiated by gamma-rays from the direction of NGC 253 were carried out in 2000
and 2001 over a total period of 150 hours. The orientation of images in
gamma-ray--like events is not consistent with emission from a point source, and
the emission region corresponds to a size greater than 10 kpc in radius. Here,
detailed descriptions of the analysis procedures and techniques are given.Comment: 16 pages, 27 figures, aa.cl
Selective phenotyping, entropy reduction, and the mastermind game.
BACKGROUND: With the advance of genome sequencing technologies, phenotyping, rather than genotyping, is becoming the most expensive task when mapping genetic traits. The need for efficient selective phenotyping strategies, i.e. methods to select a subset of genotyped individuals for phenotyping, therefore increases. Current methods have focused either on improving the detection of causative genetic variants or their precise genomic location separately. RESULTS: Here we recognize selective phenotyping as a Bayesian model discrimination problem and introduce SPARE (Selective Phenotyping Approach by Reduction of Entropy). Unlike previous methods, SPARE can integrate the information of previously phenotyped individuals, thereby enabling an efficient incremental strategy. The effective performance of SPARE is demonstrated on simulated data as well as on an experimental yeast dataset. CONCLUSIONS: Using entropy reduction as an objective criterion gives a natural way to tackle both issues of detection and localization simultaneously and to integrate intermediate phenotypic data. We foresee entropy-based strategies as a fruitful research direction for selective phenotyping
Search for TeV -rays from H1426+428 during 2004-07 with the TACTIC telescope
The BL Lac object H1426+428 () is an established source of TeV
-rays and detections of these photons from this object also have
important implications for estimating the Extragalactic Background Light (EBL)
in addition to the understanding of the particle acceleration and -ray
production mechanisms in the AGN jets. We have observed this source for about
244h in 2004, 2006 and 2007 with the TACTIC -ray telescope located at
Mt. Abu, India. Detailed analysis of these data do not indicate the presence of
any statistically significant TeV -ray signal from the source
direction. Accordingly, we have placed an upper limit of
on the integrated
-ray flux at 3 significance level.Comment: 11 pages, 5 figures accepted for publication in Journal of Physics G:
Nuclear and Particle Physic
- …