Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A Miquel-Steiner Transformation
View through CrossRef
Svaki potpuni četverokut ima tri Miquel-Steinerove točke. Bilo koji trokut zajedno s po volji odabranom točkom koja ne leži na stranicama trokuta također definira potpuni četverokut, pa stoga ova točka određuje tri Miquel-Steinerove točke. Te tri Miquelove točke tvore trokut koji je perspektivan polaznom trokutu. Preslikavanje koje točki pridružuje jedinstveno definirano središte perspektiviteta je kvadratna neinvolutivna Cremonina transformacija koju ćemo zvati Miquel-Steinerova transformacija. Proučavat ćemo djelovanje Miquel-Steinerove transformacije i njen inverz.
Title: A Miquel-Steiner Transformation
Description:
Svaki potpuni četverokut ima tri Miquel-Steinerove točke.
Bilo koji trokut zajedno s po volji odabranom točkom koja ne leži na stranicama trokuta također definira potpuni četverokut, pa stoga ova točka određuje tri Miquel-Steinerove točke.
Te tri Miquelove točke tvore trokut koji je perspektivan polaznom trokutu.
Preslikavanje koje točki pridružuje jedinstveno definirano središte perspektiviteta je kvadratna neinvolutivna Cremonina transformacija koju ćemo zvati Miquel-Steinerova transformacija.
Proučavat ćemo djelovanje Miquel-Steinerove transformacije i njen inverz.
Related Results
COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ2 METRIC SPACES
COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ2 METRIC SPACES
The Steiner tree problem is a well known network optimization problem which asks for a connected minimum network (called a Steiner minimum tree) spanning a given point set N. In th...
Dynamic Algorithms for Approximate Steiner Trees
Dynamic Algorithms for Approximate Steiner Trees
ABSTRACTThis study investigates the dynamic Steiner tree problem. The objective of the Steiner tree problem is to compute a minimum‐weight tree connecting a set of designated verti...
Poeticile memoriei la Paul Celan și George Steiner: literatura și culpa supraviețuitorului
Poeticile memoriei la Paul Celan și George Steiner: literatura și culpa supraviețuitorului
Both Paul Celan’s and George Steiner’s writings deal with the relationship between culture and barbarism; both originate in a terrible guilt of the survivor. In Paul Celan’s case, ...
Bussey systems and Steiner's tactical problem
Bussey systems and Steiner's tactical problem
In 1853, Steiner posed a number of combinatorial (tactical) problems, which eventually led to a large body of research on Steiner systems.
However, solutions to Steiner's questions...
Steiner
-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
Steiner
-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
Graph-based indexes have been widely employed to accelerate approximate similarity search of high-dimensional vectors. However, the performance of graph indexes to answer different...
Fighting for Steiner
Fighting for Steiner
Abstract
By 1938, Steiner was showing the strain of nonstop work. At home, the presence of his demanding father put strains on Max’s marriage. And although he scored...
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems. Our main contribution is...
Extensions of Steiner Triple Systems
Extensions of Steiner Triple Systems
ABSTRACTIn this article, we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple syst...