Results 151 to 160 of about 196 (191)
Some of the next articles are maybe not open access.
Node Bisectors of Cayley Graphs
Mathematical Systems Theory, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Rational bisectors of CSG primitives
Proceedings of the fifth ACM symposium on Solid modeling and applications, 1999The bisector surface of two rational surfaces in R3 is non-rational, in general. However, in some special cases, the bisector surfaces can have rational parameterization. This paper classifies some of these special cases that are related to constructive solid geometry (CSG).
Gershon Elber, Myung-Soo Kim
openaire +1 more source
Equal Bisectors at a Vertex of a Triangle
2011Given a triangle ABC, we study the conditions that its vertices must satisfy in order for the internal and external bisectors corresponding to one of the vertices to be equal. We investigate whether there are triangles for which the bisectors at each vertex are equal and other related properties.
R. Losada +2 more
openaire +1 more source
2017
Issue of The Bisector journal from Vancouver, with an article titled "The Lim Jim Petitions", which discusses and reprints several letters of support for Lim Jim from Vancouver businessmen.
openaire +1 more source
Issue of The Bisector journal from Vancouver, with an article titled "The Lim Jim Petitions", which discusses and reprints several letters of support for Lim Jim from Vancouver businessmen.
openaire +1 more source
A computational model for nonrational bisector surfaces: curve-surface and surface-surface bisectors
Proceedings Geometric Modeling and Processing 2000. Theory and Applications, 2000The bisector of two rational surfaces in R/sup 3/ is, in general, nonrational; and so is the bisector of a rational curve and a rational surface. Thus, bisector surfaces in these two cases must be approximated numerically. Unfortunately, they are algebraic surfaces of very high degree and numerical approximation is non-trivial.
Gershon Elber, Myung-Soo Kim
openaire +1 more source
Analysis of Algorithms for Reflections in Bisectors
SIAM Review, 1971Given a vector x there are two vectors u such that $(I - \theta uu^ * )x$ is a multiple of $(1,0, \ldots ,0)^ * $ , $\theta = 2(u^ * u)^{ - 1} $ We discuss the determination of $\theta $ and u in finite precision and analyze some algorithms for either choice of u in order to illustrate the role of error analysis in the design of numerical techniques.
openaire +2 more sources
1999
Abstract In real hyperbolic space, bisectors are totally geodesic and so are their intersections. In particular bisector intersections are necessarily connected. However, in complex hyperbolic geometry, this is no longer true. We have already discussed two cases of bisector intersections: cospinal pairs (where the spines lie in a common ...
openaire +1 more source
Abstract In real hyperbolic space, bisectors are totally geodesic and so are their intersections. In particular bisector intersections are necessarily connected. However, in complex hyperbolic geometry, this is no longer true. We have already discussed two cases of bisector intersections: cospinal pairs (where the spines lie in a common ...
openaire +1 more source
GEOMETRY OF BISECTORS FOR STRICTLY CONVEX DISTANCES
International Journal of Computational Geometry & Applications, 1996In this paper we study some unexpected geometric properties of the family of bisector lines for a convex distance d, showing that bisectors do not always have an asymptotic line (Section 2). Moreover, although bisectors are homeomorphic to lines, pairs of them can exist intersecting infinitely many times (Section 3).
A. Corbalan, Marisa Mazón, Tomás Recio
openaire +2 more sources
Networks, 2004
AbstractUnit disk graphs form a natural model for cellular radio channel assignment problems under the assumption of equally powerful, omnidirectional transmitters located on a uniform, flat plane. Here, we introduce and give motivation for an extension of this model, namely, sectorization at transmitter sites.
openaire +1 more source
AbstractUnit disk graphs form a natural model for cellular radio channel assignment problems under the assumption of equally powerful, omnidirectional transmitters located on a uniform, flat plane. Here, we introduce and give motivation for an extension of this model, namely, sectorization at transmitter sites.
openaire +1 more source

