We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. However, our experiments reveal that the tested code often fails for more challenging degenerate and also nearly degenerate queries.

In this article, a differential construction for the dual of an algebraic-geometric code on a projective surface is given. Afterwards, this result is used to lower bound the minimum distance of this dual code. The found bounds involve intersection numbers of some particular divisors on the surface. AMS Classification: 14J20, 94B27, 11G25.

SUMMARY In this paper, we give a new lower bound for the dimension of subeld subcodes. This bound improves the lower bound given by Stichtenoth. A BCH code and a subeld subcode of algebraic geometric code on a hyper elliptic curve are discussed as special cases.

Introduction: Image quality and accuracy of in vivo activity quantification in SPECT are affected by collimator penetration and scatter components, especially in high energy imaging. These phenomena highly depend on the collimator characteristic and photon energy. The presence of penetrated and scattered photons from collimator in SPECT images degrades spatial resolution, contr...

this paper presents a three-dimensional numerical investigation carried out in turbulent forced convection in a tube with helical ribs. enhancement of heat transfer using helically corrugated tubes has beenstudied experimentally by many researchers but there exist a few published numerical analyses results. the paper also introduces the results of heat transfer and friction factor data for inco...

Procedural geometry paradigms are analyzed and classified as either “data amplifier” or “lazy evaluation.” Lazy evaluation reduces the size of the geometric representation passed to renderers and increases the flexibility of procedural experimentation. Several existing procedural geometry systems are compared in this light, and a new one is proposed, called procedural geometric instancing. Insp...

Packet erasure codes are today a real alternative to replication in fault tolerant distributed storage systems. In this paper, we propose the Mojette erasure code based on the Mojette transform, a formerly tomographic tool. The performance of coding and decoding are compared to the Reed-Solomon code implementations of the two open-source reference libraries namely ISA-L and Jerasure 2.0. Result...

In this work, the geometric relation between space time block code design for the coherent channel and its noncoherent counterpart is exploited to get an analogue of the information theoretic inequality I(X;S) I((X;H);S) in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition res...

We model a problem about networks built from wireless devices using identifying and locating-dominating codes in unit disk graphs. It is known that minimising the size of an identifying code is NP-complete even for bipartite graphs. First, we improve this result by showing that the problem remains NP-complete for bipartite planar unit disk graphs. Then, we address the question of the existence ...

We consider the Doubly Special Relativity (DSR) generalization of Dirac equation in an external potential in the Magueijo-Smolin base. The particles obey a modified energy-momentum dispersion relation. The semiclassical diagonalization of the Dirac Hamiltonian reveals the intrinsic Berry phase effects in the particle dynamics.