---
_id: '2721'
abstract:
- lang: eng
text: We consider a multidimensional system consisting of a particle of mass M and
radius r (molecule), surrounded by an infinite ideal gas of point particles of
mass m (atoms). The molecule is confined to the unit ball and interacts with its
boundary (barrier) via elastic collision, while the atoms are not affected by
the boundary. We obtain convergence to equilibrium for the molecule from almost
every initial distribution on its position and velocity. Furthermore, we prove
that the infinite composite system of the molecule and the atoms is Bernoulli.
article_processing_charge: No
article_type: original
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dao
full_name: Tuyen, Dao
last_name: Tuyen
citation:
ama: Erdös L, Tuyen D. Ergodic properties of the multidimensional rayleigh gas with
a semipermeable barrier. Journal of Statistical Physics. 1990;59(5-6):1589-1602.
doi:10.1007/BF01334766
apa: Erdös, L., & Tuyen, D. (1990). Ergodic properties of the multidimensional
rayleigh gas with a semipermeable barrier. Journal of Statistical Physics.
Springer. https://doi.org/10.1007/BF01334766
chicago: Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional
Rayleigh Gas with a Semipermeable Barrier.” Journal of Statistical Physics.
Springer, 1990. https://doi.org/10.1007/BF01334766.
ieee: L. Erdös and D. Tuyen, “Ergodic properties of the multidimensional rayleigh
gas with a semipermeable barrier,” Journal of Statistical Physics, vol.
59, no. 5–6. Springer, pp. 1589–1602, 1990.
ista: Erdös L, Tuyen D. 1990. Ergodic properties of the multidimensional rayleigh
gas with a semipermeable barrier. Journal of Statistical Physics. 59(5–6), 1589–1602.
mla: Erdös, László, and Dao Tuyen. “Ergodic Properties of the Multidimensional Rayleigh
Gas with a Semipermeable Barrier.” Journal of Statistical Physics, vol.
59, no. 5–6, Springer, 1990, pp. 1589–602, doi:10.1007/BF01334766.
short: L. Erdös, D. Tuyen, Journal of Statistical Physics 59 (1990) 1589–1602.
date_created: 2018-12-11T11:59:15Z
date_published: 1990-06-01T00:00:00Z
date_updated: 2022-02-24T09:39:29Z
day: '01'
doi: 10.1007/BF01334766
extern: '1'
intvolume: ' 59'
issue: 5-6
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01334766
month: '06'
oa_version: None
page: 1589 - 1602
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- 1572-9613
issn:
- 0022-4715
publication_status: published
publisher: Springer
publist_id: '4171'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ergodic properties of the multidimensional rayleigh gas with a semipermeable
barrier
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 59
year: '1990'
...
---
_id: '2480'
abstract:
- lang: eng
text: Functional cDNA clones for rat neuromedin K receptor were isolated from a
rat brain cDNA library by cross-hybridization with the bovine substance K recepor
cDNA. Injection of the mRNA synthesized in vitro from the cloned cDNA into Xenopus
oocytes elicited electrophysiological responses to tachykinins, with the most
potent sensitivity being to neuromedin K. Ligand-binding displacement in membranes
of mammalian COS cells transfected with the cDNA indicated the rank order of affinity
of the receptor to tachykinins; neuromedin K > substance K > substance P.
The hybridization analysis showed that the neuromedin K receptor mRNA is expressed
in both the brain and the peripheral tissues at different levels. The rat neuromedin
K receptor consists of 452 amino acid residues and belongs to the family of G
protein-coupled receptors, which are thought to have seven transmembrane domains.
The sequence comparison of the rat neuromedin K, substance P, and substance K
receptors revealed that these receptors are highly conserved in the seven transmembrane
domains and the cytoplasmic sides of the receptors. They also show some structural
characteristics, including the common presence of histidine residues in transmembrane
segments V and VI and the difference in the numbers and distributions of serine
and threonine residues as possible phosphorylation sites in the cytoplasmic regions.
This paper thus presents the first comprehensive analysis of the molecular nature
of the multiple peptide receptors that exhibit similar but pharmacologically distinguishable
activities.
acknowledgement: This work was supported in part by research grants from the Ministry
Education, Science and Culture of Japan; the Institute of Physical and Chemical
Research; and the Science and Technology Agency of Japan. The costs of publication
of this article were defrayed in part by the payment of page charges. This article
must therefore be hereby marked “advertisement” in accordance with 18 USC. Section
1734 solely to indicate this fact.
article_processing_charge: No
article_type: original
author:
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Yoshifumi
full_name: Yokota, Yoshifumi
last_name: Yokota
- first_name: Kunihiro
full_name: Tsuchida, Kunihiro
last_name: Tsuchida
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. Cloning and expression of a
rat neuromedin K receptor cDNA. Journal of Biological Chemistry. 1990;265(2):623-628.
doi:10.1016/s0021-9258(19)40095-1
apa: Shigemoto, R., Yokota, Y., Tsuchida, K., & Nakanishi, S. (1990). Cloning
and expression of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry.
American Society for Biochemistry and Molecular Biology. https://doi.org/10.1016/s0021-9258(19)40095-1
chicago: Shigemoto, Ryuichi, Yoshifumi Yokota, Kunihiro Tsuchida, and Shigetada
Nakanishi. “Cloning and Expression of a Rat Neuromedin K Receptor CDNA.” Journal
of Biological Chemistry. American Society for Biochemistry and Molecular Biology,
1990. https://doi.org/10.1016/s0021-9258(19)40095-1
.
ieee: R. Shigemoto, Y. Yokota, K. Tsuchida, and S. Nakanishi, “Cloning and expression
of a rat neuromedin K receptor cDNA,” Journal of Biological Chemistry,
vol. 265, no. 2. American Society for Biochemistry and Molecular Biology, pp.
623–628, 1990.
ista: Shigemoto R, Yokota Y, Tsuchida K, Nakanishi S. 1990. Cloning and expression
of a rat neuromedin K receptor cDNA. Journal of Biological Chemistry. 265(2),
623–628.
mla: Shigemoto, Ryuichi, et al. “Cloning and Expression of a Rat Neuromedin K Receptor
CDNA.” Journal of Biological Chemistry, vol. 265, no. 2, American Society
for Biochemistry and Molecular Biology, 1990, pp. 623–28, doi:10.1016/s0021-9258(19)40095-1 .
short: R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological
Chemistry 265 (1990) 623–628.
date_created: 2018-12-11T11:57:55Z
date_published: 1990-01-15T00:00:00Z
date_updated: 2022-02-24T11:07:05Z
day: '15'
doi: '10.1016/s0021-9258(19)40095-1 '
extern: '1'
external_id:
pmid:
- '2153106 '
intvolume: ' 265'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0021925819400951
month: '01'
oa: 1
oa_version: Published Version
page: 623 - 628
pmid: 1
publication: Journal of Biological Chemistry
publication_identifier:
eissn:
- 1083-351X
issn:
- 0021-9258
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '4421'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cloning and expression of a rat neuromedin K receptor cDNA
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 265
year: '1990'
...
---
_id: '2481'
abstract:
- lang: eng
text: The family of mammalian tachykinin receptors consists of substance P receptor
(SPR), neuromedin K receptor (NKR) and substance K receptor (SKR). In this investigation,
tissue and regional distributions of the mRNAs for the three rat tachykinin receptors
were investigated by blot-hybridization and RNase-protection analyses using the
previously cloned receptor cDNAs. SPR mRNA is widely distributed in both the nervous
system and peripheral tissues and is expressed abundantly in the hypothalamus
and olfactory buld, as well as in the urinary bladder, salivary glands and small
and large intestines. In contrast, NKR mRNA is predominantly expressed in the
nervous system, particularly in the cortex, hypothalamus and cerebellum, whereas
SKR mRNA expression is restricted to the peripheral tissues, being abundant in
the urinary bladder, large intestine, stomach and adenal glands. Thus, the mRNAs
for the three tachykinin receptors show distinct patterns of expression between
the nervous system and peripheral tissues. Blot-hybridization analysis in combination
with S1 nuclease protection and primer-extension analyses revealed that there
are two large forms of SKR mRNA expressed commonly in the peripheral tissues,
and two additional small forms of the mRNA expressed specifically in the adrenal
gland and eye. These analyses also showed that the multiple forms of SKR mRNA
differ in the lengths of the 5' mRNA portions, and that the two small forms of
the mRNA, if translated, encode a truncated SKR polypeptide lacking the first
two transmembrane domains. This investigation thus provides the comprehensive
analysis of the distribution and mode of expression of the mRNAs for the multiple
peptide receptors and offers a new basis on which to interpret the diverse functions
of multiple tachykinin peptides in the CNS and peripheral tissues.
acknowledgement: This work was supported in part by research grants from the Ministry
of Education, Science and Culture of Japan, the Ministry of Health and Welfare
of Japan, and the Yamanouchi Foundation for Research on Metabolic Disorders
article_processing_charge: No
article_type: original
author:
- first_name: Kunihiro
full_name: Tsuchida, Kunihiro
last_name: Tsuchida
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Yoshifumi
full_name: Yokota, Yoshifumi
last_name: Yokota
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. Tissue distribution and quantitation
of the mRNAs for three rat tachykinin receptors. European Journal of Biochemistry.
1990;193(3):751-757. doi:10.1111/j.1432-1033.1990.tb19396.x
apa: Tsuchida, K., Shigemoto, R., Yokota, Y., & Nakanishi, S. (1990). Tissue
distribution and quantitation of the mRNAs for three rat tachykinin receptors.
European Journal of Biochemistry. Wiley-Blackwell. https://doi.org/10.1111/j.1432-1033.1990.tb19396.x
chicago: Tsuchida, Kunihiro, Ryuichi Shigemoto, Yoshifumi Yokota, and Shigetada
Nakanishi. “Tissue Distribution and Quantitation of the MRNAs for Three Rat Tachykinin
Receptors.” European Journal of Biochemistry. Wiley-Blackwell, 1990. https://doi.org/10.1111/j.1432-1033.1990.tb19396.x.
ieee: K. Tsuchida, R. Shigemoto, Y. Yokota, and S. Nakanishi, “Tissue distribution
and quantitation of the mRNAs for three rat tachykinin receptors,” European
Journal of Biochemistry, vol. 193, no. 3. Wiley-Blackwell, pp. 751–757, 1990.
ista: Tsuchida K, Shigemoto R, Yokota Y, Nakanishi S. 1990. Tissue distribution
and quantitation of the mRNAs for three rat tachykinin receptors. European Journal
of Biochemistry. 193(3), 751–757.
mla: Tsuchida, Kunihiro, et al. “Tissue Distribution and Quantitation of the MRNAs
for Three Rat Tachykinin Receptors.” European Journal of Biochemistry,
vol. 193, no. 3, Wiley-Blackwell, 1990, pp. 751–57, doi:10.1111/j.1432-1033.1990.tb19396.x.
short: K. Tsuchida, R. Shigemoto, Y. Yokota, S. Nakanishi, European Journal of Biochemistry
193 (1990) 751–757.
date_created: 2018-12-11T11:57:55Z
date_published: 1990-03-03T00:00:00Z
date_updated: 2022-02-24T10:20:14Z
day: '03'
doi: 10.1111/j.1432-1033.1990.tb19396.x
extern: '1'
external_id:
pmid:
- '1701145'
intvolume: ' 193'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://febs.onlinelibrary.wiley.com/doi/10.1111/j.1432-1033.1990.tb19396.x
month: '03'
oa: 1
oa_version: Published Version
page: 751 - 757
pmid: 1
publication: European Journal of Biochemistry
publication_identifier:
eissn:
- 1432-1033
issn:
- 0014-2956
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4420'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tissue distribution and quantitation of the mRNAs for three rat tachykinin
receptors
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 193
year: '1990'
...
---
_id: '2528'
abstract:
- lang: eng
text: We previously reported a novel rat membrane protein that exhibits a voltage-dependent
potassium channel activity on the basis of molecular cloning combined with an
electrophysiological assay. This protein, termed I(sK) protein, is small and different
from the conventional potassium channel proteins but induces selective permeation
of potassium ions on its expression in Xenopus oocytes. In this investigation,
we examined cellular localization of rat I(sK) protein by preparing three different
types of antibody that specifically reacts with a distinct part of rat I(sK) protein.
Immunohistochemical analysis using these antibody preparations demonstrated that
rat I(sK) protein is confined to the apical membrane portion of epithelial cells
in the proximal tubule of the kidney, the submandibular duct and the uterine endometrium.
The observed tissue distribution of rat I(sK) protein was consistent with that
of the I(sK) protein mRNA determined by blot hybridization analysis. In epithelial
cells, the sodium, potassium-ATPase pump in the basolateral membrane generates
a sodium gradient across the epithelial cell and allows sodium ions to enter the
cell through the apical membrane. Thus, taking into account the cellular localization
of the I(sK) protein, together with its electrophysiological properties, we discussed
a possible function of the I(sK) protein, namely that this protein is involved
in potassium permeation in the apical membrane of epithelial cells through the
depolarizing effect of sodium entry.
article_processing_charge: No
article_type: original
author:
- first_name: Tetsuo
full_name: Sugimoto, Tetsuo
last_name: Sugimoto
- first_name: Yasuto
full_name: Tanabe, Yasuto
last_name: Tanabe
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Masazumi
full_name: Iwai, Masazumi
last_name: Iwai
- first_name: Toru
full_name: Takumi, Toru
last_name: Takumi
- first_name: Hiroaki
full_name: Ohkubo, Hiroaki
last_name: Ohkubo
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: 'Sugimoto T, Tanabe Y, Shigemoto R, et al. Immunohistochemical study of a rat
membrane protein which induces a selective potassium permeation: Its localization
in the apical membrane portion of epithelial cells. Journal of Membrane Biology.
1990;113(1):39-47. doi:10.1007/BF01869604'
apa: 'Sugimoto, T., Tanabe, Y., Shigemoto, R., Iwai, M., Takumi, T., Ohkubo, H.,
& Nakanishi, S. (1990). Immunohistochemical study of a rat membrane protein
which induces a selective potassium permeation: Its localization in the apical
membrane portion of epithelial cells. Journal of Membrane Biology. Springer.
https://doi.org/10.1007/BF01869604'
chicago: 'Sugimoto, Tetsuo, Yasuto Tanabe, Ryuichi Shigemoto, Masazumi Iwai, Toru
Takumi, Hiroaki Ohkubo, and Shigetada Nakanishi. “Immunohistochemical Study of
a Rat Membrane Protein Which Induces a Selective Potassium Permeation: Its Localization
in the Apical Membrane Portion of Epithelial Cells.” Journal of Membrane Biology.
Springer, 1990. https://doi.org/10.1007/BF01869604.'
ieee: 'T. Sugimoto et al., “Immunohistochemical study of a rat membrane protein
which induces a selective potassium permeation: Its localization in the apical
membrane portion of epithelial cells,” Journal of Membrane Biology, vol.
113, no. 1. Springer, pp. 39–47, 1990.'
ista: 'Sugimoto T, Tanabe Y, Shigemoto R, Iwai M, Takumi T, Ohkubo H, Nakanishi
S. 1990. Immunohistochemical study of a rat membrane protein which induces a selective
potassium permeation: Its localization in the apical membrane portion of epithelial
cells. Journal of Membrane Biology. 113(1), 39–47.'
mla: 'Sugimoto, Tetsuo, et al. “Immunohistochemical Study of a Rat Membrane Protein
Which Induces a Selective Potassium Permeation: Its Localization in the Apical
Membrane Portion of Epithelial Cells.” Journal of Membrane Biology, vol.
113, no. 1, Springer, 1990, pp. 39–47, doi:10.1007/BF01869604.'
short: T. Sugimoto, Y. Tanabe, R. Shigemoto, M. Iwai, T. Takumi, H. Ohkubo, S. Nakanishi,
Journal of Membrane Biology 113 (1990) 39–47.
date_created: 2018-12-11T11:58:12Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-24T09:55:39Z
day: '01'
doi: 10.1007/BF01869604
extern: '1'
external_id:
pmid:
- '2154581'
intvolume: ' 113'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01869604
month: '01'
oa_version: None
page: 39 - 47
pmid: 1
publication: Journal of Membrane Biology
publication_identifier:
eissn:
- 1432-1424
issn:
- 0022-2631
publication_status: published
publisher: Springer
publist_id: '4371'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Immunohistochemical study of a rat membrane protein which induces a selective
potassium permeation: Its localization in the apical membrane portion of epithelial
cells'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 113
year: '1990'
...
---
_id: '4597'
abstract:
- lang: eng
text: 'A unifying framework for the study of real-time logics is developed. In analogy
to the untimed case, the underlying classical theory of timed state sequences
is identified, it is shown to be nonelementarily decidable, and its complexity
and expressiveness are used as a point of reference. Two orthogonal extensions
of PTL (timed propositional temporal logic and metric temporal logic) that inherit
its appeal are defined: they capture elementary, yet expressively complete, fragments
of the theory of timed state sequences, and thus are excellent candidates for
practical real-time specification languages'
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Alur R, Henzinger TA. Real-time logics: Complexity and expressiveness. In:
5th Annual IEEE Symposium on Logic in Computer Science. IEEE; 1990:390-401.
doi:10.1109/LICS.1990.113764'
apa: 'Alur, R., & Henzinger, T. A. (1990). Real-time logics: Complexity and
expressiveness. In 5th Annual IEEE Symposium on Logic in Computer Science
(pp. 390–401). Philadelphia, PA, USA: IEEE. https://doi.org/10.1109/LICS.1990.113764'
chicago: 'Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and
Expressiveness.” In 5th Annual IEEE Symposium on Logic in Computer Science,
390–401. IEEE, 1990. https://doi.org/10.1109/LICS.1990.113764.'
ieee: 'R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,”
in 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia,
PA, USA, 1990, pp. 390–401.'
ista: 'Alur R, Henzinger TA. 1990. Real-time logics: Complexity and expressiveness. 5th
Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science,
390–401.'
mla: 'Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.”
5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp.
390–401, doi:10.1109/LICS.1990.113764.'
short: R. Alur, T.A. Henzinger, in:, 5th Annual IEEE Symposium on Logic in Computer
Science, IEEE, 1990, pp. 390–401.
conference:
end_date: 1990-06-07
location: Philadelphia, PA, USA
name: 'LICS: Logic in Computer Science'
start_date: 1990-06-04
date_created: 2018-12-11T12:09:40Z
date_published: 1990-08-06T00:00:00Z
date_updated: 2022-02-15T14:35:30Z
day: '06'
doi: 10.1109/LICS.1990.113764
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/113764
month: '08'
oa_version: None
page: 390 - 401
publication: ' 5th Annual IEEE Symposium on Logic in Computer Science'
publication_identifier:
isbn:
- 0-8186-2073-0
publication_status: published
publisher: IEEE
publist_id: '112'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Real-time logics: Complexity and expressiveness'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1990'
...
---
_id: '3467'
abstract:
- lang: eng
text: The effects of mast cell degranulating peptide (MCDP), a toxin from the honey
bee, and of dendrotoxin (DTX), a toxin from the green mamba snake, were studied
in voltage-clamped experiments with myelinated nerve fibres of Xenopus. MCDP and
DTX blocked part of the K+ current. About 20% of the K+ current, however, was
resistant to the toxins even in high concentrations. In Ringer solution half-maximal
block was reached with concentrations of 33 nM MCDP and 11 nM DTX. In high-K+
solution the potency of both toxins was lower. β-Bungarotoxin (β-BuTX), another
snake toxin, also blocked part of the K+ current, but was less potent than MCDP
and DTX. Tail currents in high-K+ solution were analysed and three K+ current
components were separated according to Dubois (1981b). Both MCDP and DTX selectively
blocked a fast deactivating, slowly inactivating K+ current component which steeply
activates between E = -60 mV and E = -40 mV (component f1). In concentrations
around 100 nM, MCDP and DTX blocked neither the slow K+ current (component s)
nor the fast deactivating, rapidly inactivating K+ current which activates between
E = -40 mV and E = 20 mV (component f2). Similar results could be derived from
K+ outward currents in Ringer solution. In high-K+, IC50 of MCDP for component
f1 was 99 nM, whereas it was 7.6 μM for f2. Corresponding values for DTX are 68
nM and 1.8 μM. Binding studies with nerve fibre membranes of Xenopus reveal high-affinity
binding sites for 125I-labelled DTX )K(D) = 22 pM in Ringer solution and 81 pM
in high-K+ solution). 125I-labelled DTX can be displaced from its sites completely
by unlabelled DTX, toxin I (black mamba toxin), MCDP, and partially by β-BuTX.
Immunocytochemical staining demonstrates that binding sites for DTX are present
in nodal and paranodal regions of the axonal membrane. The axonal membrane of
motor and sensory nerve fibres is equipped with three types of well-characterized
K+ channels and constitutes so far the best preparation to study MCDP- and DTX-sensitive
K+ channels with electrophysiological and biochemical methods.
acknowledgement: "We thank Professor E. Habermann for critical reading of the manuscript
and E. Schmidt and J. Schafer for technical assistance. Financial support by the
Deutsche Forschungsgemeinschaft (Vo 188/13-1 and SFB 249) is gratefully acknowledged.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Bräu, Michael
last_name: Bräu
- first_name: Florian
full_name: Dreyer, Florian
last_name: Dreyer
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Holger
full_name: Repp, Holger
last_name: Repp
- first_name: Werner
full_name: Vogel, Werner
last_name: Vogel
citation:
ama: 'Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. A K+ channel in Xenopus nerve
fibres selectively blocked by bee and snake toxins: binding and voltage-clamp
experiments. Journal of Physiology. 1990;420:365-385. doi:10.1113/jphysiol.1990.sp017918'
apa: 'Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., & Vogel, W. (1990). A K+
channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding
and voltage-clamp experiments. Journal of Physiology. Wiley-Blackwell.
https://doi.org/10.1113/jphysiol.1990.sp017918'
chicago: 'Bräu, Michael, Florian Dreyer, Peter M Jonas, Holger Repp, and Werner
Vogel. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake
Toxins: Binding and Voltage-Clamp Experiments.” Journal of Physiology.
Wiley-Blackwell, 1990. https://doi.org/10.1113/jphysiol.1990.sp017918.'
ieee: 'M. Bräu, F. Dreyer, P. M. Jonas, H. Repp, and W. Vogel, “A K+ channel in
Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and
voltage-clamp experiments,” Journal of Physiology, vol. 420. Wiley-Blackwell,
pp. 365–385, 1990.'
ista: 'Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. 1990. A K+ channel in Xenopus
nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp
experiments. Journal of Physiology. 420, 365–385.'
mla: 'Bräu, Michael, et al. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked
by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” Journal of
Physiology, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:10.1113/jphysiol.1990.sp017918.'
short: M. Bräu, F. Dreyer, P.M. Jonas, H. Repp, W. Vogel, Journal of Physiology
420 (1990) 365–385.
date_created: 2018-12-11T12:03:29Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-23T16:10:03Z
day: '01'
doi: 10.1113/jphysiol.1990.sp017918
extern: '1'
external_id:
pmid:
- '2324990'
intvolume: ' 420'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1190055/
month: '01'
oa: 1
oa_version: None
page: 365 - 385
pmid: 1
publication: Journal of Physiology
publication_identifier:
eissn:
- 1469-7793
issn:
- 0022-3751
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2920'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake
toxins: binding and voltage-clamp experiments'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 420
year: '1990'
...
---
_id: '3565'
abstract:
- lang: eng
text: We investigate the complexity of determining the shape and presentation (i.e.
position with orientation) of convex polytopes in multi-dimensional Euclidean
space using a variety of probe models.
acknowledgement: "NSF Grant MCS-83-03926 and DCR-85-05517\r\nAmoco Foundation Faculty
Development in Computer Science\r\nNSF Grant DCR-84-01633 and DCR-84-01898"
article_processing_charge: No
author:
- first_name: David
full_name: Dobkin, David
last_name: Dobkin
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Chee
full_name: Yap, Chee
last_name: Yap
citation:
ama: 'Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong
G, eds. Autonomous Robot Vehicles. Springer; 1990:328-341. doi:10.1007/978-1-4613-8997-2_25'
apa: Dobkin, D., Edelsbrunner, H., & Yap, C. (1990). Probing convex polytopes.
In I. Cox & G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341).
Springer. https://doi.org/10.1007/978-1-4613-8997-2_25
chicago: Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.”
In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong,
328–41. Springer, 1990. https://doi.org/10.1007/978-1-4613-8997-2_25.
ieee: D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous
Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.
ista: 'Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous
Robot Vehicles. , 328–341.'
mla: Dobkin, David, et al. “Probing Convex Polytopes.” Autonomous Robot Vehicles,
edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.
short: D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous
Robot Vehicles, Springer, 1990, pp. 328–341.
date_created: 2018-12-11T12:03:59Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-23T15:41:07Z
day: '01'
doi: 10.1007/978-1-4613-8997-2_25
editor:
- first_name: Ingemar
full_name: Cox, Ingemar
last_name: Cox
- first_name: Gordon
full_name: Wilfong, Gordon
last_name: Wilfong
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-1-4613-8997-2_25
month: '01'
oa_version: None
page: 328 - 341
publication: Autonomous Robot Vehicles
publication_identifier:
isbn:
- 978-1-4613-8997-2
publication_status: published
publisher: Springer
publist_id: '2820'
quality_controlled: '1'
status: public
title: Probing convex polytopes
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1990'
...
---
_id: '3650'
abstract:
- lang: eng
text: Hybrid zones can yield estimates of natural selection and gene flow. The width
of a cline in gene frequency is approximately proportional to gene flow (σ) divided
by the square root of per-locus selection ( &s). Gene flow also causes gametic
correlations (linkage disequilibria) between genes that differ across hybrid zones.
Correlations are stronger when the hybrid zone is narrow, and rise to a maximum
roughly equal to s. Thus cline width and gametic correlations combine to give
estimates of gene flow and selection. These indirect measures of σ and s are especially
useful because they can be made from collections, and require no field experiments.
The method was applied to hybrid zones between color pattern races in a pair of
Peruvian Heliconius butterfly species. The species are Mullerian mimics of one
another, and both show the same changes in warning color pattern across their
respective hybrid zones. The expectations of cline width and gametic correlation
were generated using simulations of clines stabilized by strong frequency-dependent
selection. In the hybrid zone in Heliconius erato, clines at three major color
pattern loci were between 8.5 and 10.2 km wide, and the pairwise gametic correlations
peaked at R & 0.35. These measures suggest that s & 0.23 per locus, and
that σ & 2.6 km. In erato, the shapes of the clines agreed with that expected
on the basis of dominance. Heliconius melpomene has a nearly coincident hybrid
zone. In this species, cline widths at four major color pattern loci varied between
11.7 and 13.4 km. Pairwise gametic correlations peaked near R & 1.00 for tightly
linked genes, and at R & 0.40 for unlinked genes, giving s & 0.25 per
locus and σ & 3.7 km. In melpomene, cline shapes did not perfectly fit theoretical
shapes based on dominance; this deviation might be explained by long-distance
migration and/or strong epistasis. Compared with erato, sample sizes in melpomene
are lower and the genetics of its color patterns are less well understood. In
spite of these problems, selection and gene flow are clearly of the same order
of magnitude in the two species. The relatively high per locus selection coefficients
agree with ``major gene'' theories for the evolution of Mullerian mimicry, but
the genetic architecture of the color patterns does not. These results show that
the genetics and evolution of mimicry are still only sketchily understood.
acknowledgement: 'We thank the Natural Environmental Research Council, the Royal Society,
the Nuffield Foundation, CONCYTEC, and Mrs. G. W. BORLASE for financial support,
and the people of San Martin for their generous hospitality. We are very grateful
to S. D. KNAPP, who helped by maintaining our sanity and rearing larvae. We are
also grateful to an anonymous reviewer, A. W. PORTER, J. C. SCHNEIDER, M. TURELLI
and C. E. WATSON for helpful comments on the manuscript. This paper was approved
for publication as journal article no. 5-7255 of the Mississippi Agricultural and
Forestry Experiment Station, Mississippi State University, project no. MIS-2 122. '
article_processing_charge: No
article_type: original
author:
- first_name: James
full_name: Mallet, James
last_name: Mallet
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gerado
full_name: Lamas, Gerado
last_name: Lamas
- first_name: José
full_name: Santisteban, José
last_name: Santisteban
- first_name: Manuel
full_name: Muedas, Manuel
last_name: Muedas
- first_name: Harriet
full_name: Eeley, Harriet
last_name: Eeley
citation:
ama: Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. Estimates of
selection and gene flow from measures of cline width and linkage disequilibrium
in Heliconius hybrid zones. Genetics. 1990;124(4):921-936. doi:10.1093/genetics/124.4.921
apa: Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., & Eeley,
H. (1990). Estimates of selection and gene flow from measures of cline width and
linkage disequilibrium in Heliconius hybrid zones. Genetics. Genetics Society
of America. https://doi.org/10.1093/genetics/124.4.921
chicago: Mallet, James, Nicholas H Barton, Gerado Lamas, José Santisteban, Manuel
Muedas, and Harriet Eeley. “Estimates of Selection and Gene Flow from Measures
of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” Genetics.
Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.4.921.
ieee: J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley,
“Estimates of selection and gene flow from measures of cline width and linkage
disequilibrium in Heliconius hybrid zones,” Genetics, vol. 124, no. 4.
Genetics Society of America, pp. 921–936, 1990.
ista: Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. 1990. Estimates
of selection and gene flow from measures of cline width and linkage disequilibrium
in Heliconius hybrid zones. Genetics. 124(4), 921–936.
mla: Mallet, James, et al. “Estimates of Selection and Gene Flow from Measures of
Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” Genetics,
vol. 124, no. 4, Genetics Society of America, 1990, pp. 921–36, doi:10.1093/genetics/124.4.921.
short: J. Mallet, N.H. Barton, G. Lamas, J. Santisteban, M. Muedas, H. Eeley, Genetics
124 (1990) 921–936.
date_created: 2018-12-11T12:04:26Z
date_published: 1990-04-01T00:00:00Z
date_updated: 2022-02-23T11:04:17Z
day: '01'
doi: 10.1093/genetics/124.4.921
extern: '1'
external_id:
pmid:
- '2323556'
intvolume: ' 124'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203983/
month: '04'
oa: 1
oa_version: Published Version
page: 921 - 936
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2733'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Estimates of selection and gene flow from measures of cline width and linkage
disequilibrium in Heliconius hybrid zones
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 124
year: '1990'
...
---
_id: '3651'
abstract:
- lang: eng
text: 'It is widely held that each gene typically affects many characters, and that
each character is affected by many genes. Moreover, strong stabilizing selection
cannot act on an indefinitely large number of independent traits. This makes it
likely that heritable variation in any one trait is maintained as a side effect
of polymorphisms which have nothing to do with selection on that trait. This paper
examines the idea that variation is maintained as the pleiotropic side effect
of either deleterious mutation, or balancing selection. If mutation is responsible,
it must produce alleles which are only mildly deleterious (s & 10(-3)), but
nevertheless have significant effects on the trait. Balancing selection can readily
maintain high heritabilities; however, selection must be spread over many weakly
selected polymorphisms if large responses to artificial selection are to be possible.
In both classes of pleiotropic model, extreme phenotypes are less fit, giving
the appearance of stabilizing selection on the trait. However, it is shown that
this effect is weak (of the same order as the selection on each gene): the strong
stabilizing selection which is often observed is likely to be caused by correlations
with a limited number of directly selected traits. Possible experiments for distinguishing
the alternatives are discussed.'
acknowledgement: Thanks to JERRY COYNE, BILL HILL, LINDA PARTRIDGE, MICHAEL TURELLI,
and two anonymous reviewers for their critical comments. This work was supported
by grants from the National Science Foundation (BSR-8866548) the Science and Engineering
Research Council (GR/E/08507), and by the Institute of Theoretical Dynamics, University
of California, Davis.
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782.
doi:10.1093/genetics/124.3.773
apa: Barton, N. H. (1990). Pleiotropic models of quantitative variation. Genetics.
Genetics Society of America. https://doi.org/10.1093/genetics/124.3.773
chicago: Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics.
Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.3.773 .
ieee: N. H. Barton, “Pleiotropic models of quantitative variation,” Genetics,
vol. 124, no. 3. Genetics Society of America, pp. 773–782, 1990.
ista: Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3),
773–782.
mla: Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics,
vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi:10.1093/genetics/124.3.773 .
short: N.H. Barton, Genetics 124 (1990) 773–782.
date_created: 2018-12-11T12:04:26Z
date_published: 1990-03-01T00:00:00Z
date_updated: 2022-02-23T10:41:43Z
day: '01'
doi: '10.1093/genetics/124.3.773 '
extern: '1'
external_id:
pmid:
- '2311921'
intvolume: ' 124'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://academic.oup.com/genetics/article/124/3/773/5999956?login=true
month: '03'
oa: 1
oa_version: Published Version
page: 773 - 782
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2732'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Pleiotropic models of quantitative variation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 124
year: '1990'
...
---
_id: '4060'
abstract:
- lang: eng
text: This paper offers combinatorial results on extremum problems concerning the
number of tetrahedra in a tetrahedrization of n points in general position in
three dimensions, i.e. such that no four points are co-planar, It also presents
an algorithm that in O(n log n) time constructs a tetrahedrization of a set of
n points consisting of at most 3n-11 tetrahedra.
acknowledgement: Research of the first author is supported by Amoco Fnd. Fac. Dec.
Comput. Sci. 1-6-44862, the second author is supported by NSF Grant ECS 84-10902,
and research of the third author is supported in part by ONR Grant N00014-85K0570
and by NSF Grant DMS 8504322.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Franco
full_name: Preparata, Franco
last_name: Preparata
- first_name: Douglas
full_name: West, Douglas
last_name: West
citation:
ama: Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions.
Journal of Symbolic Computation. 1990;10(3-4):335-347. doi:10.1016/S0747-7171(08)80068-5
apa: Edelsbrunner, H., Preparata, F., & West, D. (1990). Tetrahedrizing point
sets in three dimensions. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/S0747-7171(08)80068-5
chicago: Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing
Point Sets in Three Dimensions.” Journal of Symbolic Computation. Elsevier,
1990. https://doi.org/10.1016/S0747-7171(08)80068-5.
ieee: H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in
three dimensions,” Journal of Symbolic Computation, vol. 10, no. 3–4. Elsevier,
pp. 335–347, 1990.
ista: Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three
dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.
mla: Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.”
Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp.
335–47, doi:10.1016/S0747-7171(08)80068-5.
short: H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10
(1990) 335–347.
date_created: 2018-12-11T12:06:42Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-23T10:10:35Z
day: '01'
doi: 10.1016/S0747-7171(08)80068-5
extern: '1'
intvolume: ' 10'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0747717108800685?via%3Dihub
month: '01'
oa: 1
oa_version: Published Version
page: 335 - 347
publication: Journal of Symbolic Computation
publication_identifier:
eissn:
- 1095-855X
issn:
- 0747-7171
publication_status: published
publisher: Elsevier
publist_id: '2061'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tetrahedrizing point sets in three dimensions
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1990'
...
---
_id: '4063'
abstract:
- lang: eng
text: This paper describes a general-purpose programming technique, called Simulation
of Simplicity, that can be used to cope with degenerate input data for geometric
algorithms. It relieves the programmer from the task of providing a consistent
treatment for every single special case that can occur. The programs that use
the technique tend to be considerably smaller and more robust than those that
do not use it. We believe that this technique will become a standard tool in writing
geometric software.
acknowledgement: 'Research of both authors was supported by Amoco Foundation Faculty
Development grant CS 1-6-44862. It was partially carried out while both authors
were with the Institutes for Information Processing at the Technical University
of Graz, Austria. The first author also acknowledges support by the National Science
Foundation under grant CCR-8714565. '
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ernst
full_name: Mücke, Ernst
last_name: Mücke
citation:
ama: 'Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with
degenerate cases in geometric algorithms. ACM Transactions on Graphics.
1990;9(1):66-104. doi:10.1145/77635.77639'
apa: 'Edelsbrunner, H., & Mücke, E. (1990). Simulation of simplicity: A technique
to cope with degenerate cases in geometric algorithms. ACM Transactions on
Graphics. ACM. https://doi.org/10.1145/77635.77639'
chicago: 'Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique
to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on
Graphics. ACM, 1990. https://doi.org/10.1145/77635.77639.'
ieee: 'H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope
with degenerate cases in geometric algorithms,” ACM Transactions on Graphics,
vol. 9, no. 1. ACM, pp. 66–104, 1990.'
ista: 'Edelsbrunner H, Mücke E. 1990. Simulation of simplicity: A technique to cope
with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 9(1),
66–104.'
mla: 'Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique
to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on
Graphics, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi:10.1145/77635.77639.'
short: H. Edelsbrunner, E. Mücke, ACM Transactions on Graphics 9 (1990) 66–104.
date_created: 2018-12-11T12:06:43Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-22T14:58:39Z
day: '01'
doi: 10.1145/77635.77639
extern: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/77635.77639
month: '01'
oa_version: None
page: 66 - 104
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: ACM
publist_id: '2058'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Simulation of simplicity: A technique to cope with degenerate cases in geometric
algorithms'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 9
year: '1990'
...
---
_id: '4064'
abstract:
- lang: eng
text: Given a set of data points pi = (xi, yi ) for 1 ≤ i ≤ n, the least median
of squares regression line is a line y = ax + b for which the median of the squared
residuals is a minimum over all choices of a and b. An algorithm is described
that computes such a line in O(n 2) time and O(n) memory space, thus improving
previous upper bounds on the problem. This algorithm is an application of a general
method built on top of the topological sweep of line arrangements.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Diane
full_name: Souvaine, Diane
last_name: Souvaine
citation:
ama: Edelsbrunner H, Souvaine D. Computing least median of squares regression lines
and guided topological sweep. Journal of the American Statistical Association.
1990;85(409):115-119. doi:10.1080/01621459.1990.10475313
apa: Edelsbrunner, H., & Souvaine, D. (1990). Computing least median of squares
regression lines and guided topological sweep. Journal of the American Statistical
Association. American Statistical Association. https://doi.org/10.1080/01621459.1990.10475313
chicago: Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares
Regression Lines and Guided Topological Sweep.” Journal of the American Statistical
Association. American Statistical Association, 1990. https://doi.org/10.1080/01621459.1990.10475313.
ieee: H. Edelsbrunner and D. Souvaine, “Computing least median of squares regression
lines and guided topological sweep,” Journal of the American Statistical Association,
vol. 85, no. 409. American Statistical Association, pp. 115–119, 1990.
ista: Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression
lines and guided topological sweep. Journal of the American Statistical Association.
85(409), 115–119.
mla: Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares
Regression Lines and Guided Topological Sweep.” Journal of the American Statistical
Association, vol. 85, no. 409, American Statistical Association, 1990, pp.
115–19, doi:10.1080/01621459.1990.10475313.
short: H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association
85 (1990) 115–119.
date_created: 2018-12-11T12:06:43Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-22T15:10:54Z
day: '01'
doi: 10.1080/01621459.1990.10475313
extern: '1'
intvolume: ' 85'
issue: '409'
language:
- iso: eng
main_file_link:
- url: https://www.tandfonline.com/doi/abs/10.1080/01621459.1990.10475313
month: '01'
oa_version: None
page: 115 - 119
publication: Journal of the American Statistical Association
publication_identifier:
eissn:
- 1537-274X
issn:
- 0003-1291
publication_status: published
publisher: American Statistical Association
publist_id: '2059'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing least median of squares regression lines and guided topological sweep
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 85
year: '1990'
...
---
_id: '4065'
abstract:
- lang: eng
text: We prove that given n⩾3 convex, compact, and pairwise disjoint sets in the
plane, they may be covered with n non-overlapping convex polygons with a total
of not more than 6n−9 sides, and with not more than 3n−6 distinct slopes. Furthermore,
we construct sets that require 6n−9 sides and 3n−6 slopes for n⩾3. The upper bound
on the number of slopes implies a new bound on a recently studied transversal
problem.
acknowledgement: 'The first author acknowledges the support by Amoco Fnd. Fat. Dev.
Comput. Sci. l-6-44862. Work on this paper by the second author was supported by
a Shell Fellowship in Computer Science. The third author as supported by the office
of Naval Research under grant NOOO14-86K-0416. '
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Arch
full_name: Robison, Arch
last_name: Robison
- first_name: Xiao
full_name: Shen, Xiao
last_name: Shen
citation:
ama: Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping
polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A
apa: Edelsbrunner, H., Robison, A., & Shen, X. (1990). Covering convex sets
with non-overlapping polygons. Discrete Mathematics. Elsevier. https://doi.org/10.1016/0012-365X(90)90147-A
chicago: Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets
with Non-Overlapping Polygons.” Discrete Mathematics. Elsevier, 1990. https://doi.org/10.1016/0012-365X(90)90147-A.
ieee: H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping
polygons,” Discrete Mathematics, vol. 81, no. 2. Elsevier, pp. 153–164,
1990.
ista: Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping
polygons. Discrete Mathematics. 81(2), 153–164.
mla: Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.”
Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.
short: H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
date_created: 2018-12-11T12:06:44Z
date_published: 1990-04-15T00:00:00Z
date_updated: 2022-02-22T15:45:55Z
day: '15'
doi: 10.1016/0012-365X(90)90147-A
extern: '1'
intvolume: ' 81'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/0012365X9090147A?via%3Dihub
month: '04'
oa_version: None
page: 153 - 164
publication: Discrete Mathematics
publication_identifier:
eissn:
- 1872-681X
issn:
- 0012-365X
publication_status: published
publisher: Elsevier
publist_id: '2060'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Covering convex sets with non-overlapping polygons
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 81
year: '1990'
...
---
_id: '4066'
abstract:
- lang: eng
text: 'We consider several problems involving points and planes in three dimensions.
Our main results are: (i) The maximum number of faces boundingm distinct cells
in an arrangement ofn planes isO(m 2/3 n logn +n 2); we can calculatem such cells
specified by a point in each, in worst-case timeO(m 2/3 n log3 n+n 2 logn). (ii)
The maximum number of incidences betweenn planes andm vertices of their arrangement
isO(m 2/3 n logn+n 2), but this number is onlyO(m 3/5– n 4/5+2 +m+n logm), for
any>0, for any collection of points no three of which are collinear. (iii)
For an arbitrary collection ofm points, we can calculate the number of incidences
between them andn planes by a randomized algorithm whose expected time complexity
isO((m 3/4– n 3/4+3 +m) log2 n+n logn logm) for any>0. (iv) Givenm points andn
planes, we can find the plane lying immediately below each point in randomized
expected timeO([m 3/4– n 3/4+3 +m] log2 n+n logn logm) for any>0. (v) The maximum
number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an
arrangement ofn hyperplanes ind dimensions,d>3, isO(m 2/3 n d/3 logn+n d–1).
This is also an upper bound for the number of incidences betweenn hyperplanes
ind dimensions andm vertices of their arrangement. The combinatorial bounds in
(i) and (v) and the general bound in (ii) are almost tight.'
acknowledgement: "Supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by
NSF Grant CCR-8714565. Work on this paper by the first author has been supported
by Amoco Fnd. Fac. Dev. Comput. Sci. I-6-44862 and by NSF Grant CCR-87t4565. Work
by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129,
by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment
Corporation, and the IBM Corporation, and by a research grant from the NCRD--the
Israeli National Council for Research and Development. An abstract of this\r\npaper
has appeared in the Proceedings of the 13th International Mathematical Programming
Symposium, Tokyo, 1988, p. 147"
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements
of planes and related problems. Discrete & Computational Geometry.
1990;5(1):197-216. doi:10.1007/BF02187785
apa: Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity of many
cells in arrangements of planes and related problems. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02187785
chicago: Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity
of Many Cells in Arrangements of Planes and Related Problems.” Discrete &
Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187785.
ieee: H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in
arrangements of planes and related problems,” Discrete & Computational
Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
ista: Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in
arrangements of planes and related problems. Discrete & Computational Geometry.
5(1), 197–216.
mla: Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements
of Planes and Related Problems.” Discrete & Computational Geometry,
vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
short: H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry
5 (1990) 197–216.
date_created: 2018-12-11T12:06:44Z
date_published: 1990-03-01T00:00:00Z
date_updated: 2022-02-22T11:02:41Z
day: '01'
doi: 10.1007/BF02187785
extern: '1'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02187785
month: '03'
oa_version: None
page: 197 - 216
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2054'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The complexity of many cells in arrangements of planes and related problems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 5
year: '1990'
...
---
_id: '4067'
abstract:
- lang: eng
text: This paper proves an O(m 2/3 n 2/3+m+n) upper bound on the number of incidences
between m points and n hyperplanes in four dimensions, assuming all points lie
on one side of each hyperplane and the points and hyperplanes satisfy certain
natural general position conditions. This result has application to various three-dimensional
combinatorial distance problems. For example, it implies the same upper bound
for the number of bichromatic minimum distance pairs in a set of m blue and n
red points in three-dimensional space. This improves the best previous bound for
this problem.
acknowledgement: Research of the first author was supported by the National Science
Foundation under grant CCR-8714565. Work of the second author was supported by Office
of Naval Research Grants DCR-83-20085 and CCR-89-01484, and by grants from the U.S.-Israeli
Binational Science Foundation, the NCRD — the Israeli National Council for Research
and Development, and the Fund for Basic Research in Electronics, Computers and Communication
administered by the Israeli Academy of Sciences.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: 'Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications
to counting distances. In: Proceedings of the International Symposium on Algorithms.
Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91'
apa: 'Edelsbrunner, H., & Sharir, M. (1990). A hyperplane Incidence problem
with applications to counting distances. In Proceedings of the International
Symposium on Algorithms (Vol. 450, pp. 419–428). Tokyo, Japan: Springer. https://doi.org/10.1007/3-540-52921-7_91'
chicago: Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem
with Applications to Counting Distances.” In Proceedings of the International
Symposium on Algorithms, 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91.
ieee: H. Edelsbrunner and M. Sharir, “A hyperplane Incidence problem with applications
to counting distances,” in Proceedings of the International Symposium on Algorithms,
Tokyo, Japan, 1990, vol. 450, pp. 419–428.
ista: Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications
to counting distances. Proceedings of the International Symposium on Algorithms.
SIGAL: Special Interest Group on Algorithms, International Symposium on Algorithms
, LNCS, vol. 450, 419–428.
mla: Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with
Applications to Counting Distances.” Proceedings of the International Symposium
on Algorithms, vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.
short: H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium
on Algorithms, Springer, 1990, pp. 419–428.
conference:
end_date: 1990-08-18
location: Tokyo, Japan
name: 'SIGAL: Special Interest Group on Algorithms, International Symposium on
Algorithms '
start_date: 1990-08-16
date_created: 2018-12-11T12:06:45Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-22T14:31:26Z
day: '01'
doi: 10.1007/3-540-52921-7_91
extern: '1'
intvolume: ' 450'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/3-540-52921-7_91
month: '01'
oa_version: None
page: 419 - 428
publication: Proceedings of the International Symposium on Algorithms
publication_identifier:
isbn:
- 978-3-540-52921-7
publication_status: published
publisher: Springer
publist_id: '2056'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A hyperplane Incidence problem with applications to counting distances
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 450
year: '1990'
...
---
_id: '4068'
abstract:
- lang: eng
text: "LetS be a collection ofn convex, closed, and pairwise nonintersecting sets
in the Euclidean plane labeled from 1 ton. A pair of permutations\r\n(i1i2in−1in)(inin−1i2i1)
\r\nis called ageometric permutation of S if there is a line that intersects all
sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations.
This upper bound is tight."
acknowledgement: Research of the first author was supported by Amoco Foundation for
Faculty Development in Computer Science Grant No. 1-6-44862. Work on this paper
by the second author was supported by Office of Naval Research Grant No. N00014-82-K-0381,
National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital
Equipment Corporation and the IBM Corporation.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting
sets in the plane is 2n−2. Discrete & Computational Geometry. 1990;5(1):35-42.
doi:10.1007/BF02187778
apa: Edelsbrunner, H., & Sharir, M. (1990). The maximum number of ways to stabn
convex nonintersecting sets in the plane is 2n−2. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02187778
chicago: Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to
Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational
Geometry. Springer, 1990. https://doi.org/10.1007/BF02187778.
ieee: H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex
nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry,
vol. 5, no. 1. Springer, pp. 35–42, 1990.
ista: Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex
nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry.
5(1), 35–42.
mla: Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn
Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational
Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.
short: H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990)
35–42.
date_created: 2018-12-11T12:06:45Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-22T14:50:34Z
day: '01'
doi: 10.1007/BF02187778
extern: '1'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02187778
month: '01'
oa_version: None
page: 35 - 42
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2057'
quality_controlled: '1'
status: public
title: The maximum number of ways to stabn convex nonintersecting sets in the plane
is 2n−2
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 5
year: '1990'
...
---
_id: '4069'
abstract:
- lang: eng
text: Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained
by orthogonal projection of the faces of a convex polytope in d + 1 dimensions.
For example, the Delaunay triangulation of a finite point set is such a cell complex.
This paper shows that the in front/behind relation defined for the faces of C
with respect to any fixed viewpoint x is acyclic. This result has applications
to hidden line/surface removal and other problems in computational geometry.
acknowledgement: Research reported in this paper was supported by the National Science
Foundation under grant CCR-8714565.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. Combinatorica.
1990;10(3):251-260. doi:10.1007/BF02122779
apa: Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension.
Combinatorica. Springer. https://doi.org/10.1007/BF02122779
chicago: Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”
Combinatorica. Springer, 1990. https://doi.org/10.1007/BF02122779.
ieee: H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,”
Combinatorica, vol. 10, no. 3. Springer, pp. 251–260, 1990.
ista: Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension.
Combinatorica. 10(3), 251–260.
mla: Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”
Combinatorica, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.
short: H. Edelsbrunner, Combinatorica 10 (1990) 251–260.
date_created: 2018-12-11T12:06:45Z
date_published: 1990-09-01T00:00:00Z
date_updated: 2022-02-21T11:08:30Z
day: '01'
doi: 10.1007/BF02122779
extern: '1'
intvolume: ' 10'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02122779
month: '09'
oa_version: None
page: 251 - 260
publication: Combinatorica
publication_identifier:
eissn:
- 1439-6912
issn:
- 0209-9683
publication_status: published
publisher: Springer
publist_id: '2050'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An acyclicity theorem for cell complexes in d dimension
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1990'
...
---
_id: '4070'
abstract:
- lang: eng
text: Let S be a set of n closed intervals on the x-axis. A ranking assigns to each
interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)International Journal of Computer Mathematics.
1990;34(3-4):129-144. doi:10.1080/00207169008803871
apa: Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., & Feldman, J. (1990).
Ranking intervals under visibility constraints. International Journal of Computer
Mathematics. Taylor & Francis. https://doi.org/10.1080/00207169008803871
chicago: Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack
Feldman. “Ranking Intervals under Visibility Constraints.” International Journal
of Computer Mathematics. Taylor & Francis, 1990. https://doi.org/10.1080/00207169008803871.
ieee: H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking
intervals under visibility constraints,” International Journal of Computer
Mathematics, vol. 34, no. 3–4. Taylor & Francis, pp. 129–144, 1990.
ista: Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals
under visibility constraints. International Journal of Computer Mathematics. 34(3–4),
129–144.
mla: Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.”
International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor
& Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.
short: H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International
Journal of Computer Mathematics 34 (1990) 129–144.
date_created: 2018-12-11T12:06:46Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-21T13:19:52Z
day: '01'
doi: 10.1080/00207169008803871
extern: '1'
intvolume: ' 34'
issue: 3-4
language:
- iso: eng
main_file_link:
- url: https://www.tandfonline.com/doi/abs/10.1080/00207169008803871
month: '01'
oa_version: None
page: 129 - 144
publication: International Journal of Computer Mathematics
publication_identifier:
eissn:
- 1029-0265
issn:
- 0020-7160
publication_status: published
publisher: Taylor & Francis
publist_id: '2051'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ranking intervals under visibility constraints
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 34
year: '1990'
...
---
_id: '4071'
abstract:
- lang: eng
text: We show that a triangulation of a set of n points in the plane that minimizes
the maximum angle can be computed in time O(n2 log n) and space O(n). In the same
amount of time and space we can also handle the constrained case where edges are
prescribed. The algorithm iteratively improves an arbitrary initial triangulation
and is fairly easy to implement.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
- first_name: Roman
full_name: Waupotitsch, Roman
last_name: Waupotitsch
citation:
ama: 'Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the
MinMax angle triangulation. In: Proceedings of the 6th Annual Symposium on
Computational Geometry. ACM; 1990:44-52. doi:10.1145/98524.98535'
apa: 'Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1990). An O(n^2log n) time
algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual
symposium on Computational geometry (pp. 44–52). Berkley, CA, United States:
ACM. https://doi.org/10.1145/98524.98535'
chicago: Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n)
Time Algorithm for the MinMax Angle Triangulation.” In Proceedings of the 6th
Annual Symposium on Computational Geometry, 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.
ieee: H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm
for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium
on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.
ista: 'Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm
for the MinMax angle triangulation. Proceedings of the 6th annual symposium on
Computational geometry. SCG: Symposium on Computational Geometry, 44–52.'
mla: Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax
Angle Triangulation.” Proceedings of the 6th Annual Symposium on Computational
Geometry, ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
short: H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual
Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
conference:
end_date: 1990-06-09
location: Berkley, CA, United States
name: 'SCG: Symposium on Computational Geometry'
start_date: 1990-06-07
date_created: 2018-12-11T12:06:46Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-22T08:56:42Z
day: '01'
doi: 10.1145/98524.98535
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/98524.98535
month: '01'
oa_version: None
page: 44 - 52
publication: Proceedings of the 6th annual symposium on Computational geometry
publication_identifier:
isbn:
- 978-0-89791-362-1
publication_status: published
publisher: ACM
publist_id: '2052'
quality_controlled: '1'
status: public
title: An O(n^2log n) time algorithm for the MinMax angle triangulation
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1990'
...
---
_id: '4072'
abstract:
- lang: eng
text: We show that the total number of edges ofm faces of an arrangement ofn lines
in the plane isO(m 2/3– n 2/3+2 +n) for any>0. The proof takes an algorithmic
approach, that is, we describe an algorithm for the calculation of thesem faces
and derive the upper bound from the analysis of the algorithm. The algorithm uses
randomization and its expected time complexity isO(m 2/3– n 2/3+2 logn+n logn
logm). If instead of lines we have an arrangement ofn line segments, then the
maximum number of edges ofm faces isO(m 2/3– n 2/3+2 +n (n) logm) for any>0,
where(n) is the functional inverse of Ackermann's function. We give a (randomized)
algorithm that produces these faces and takes expected timeO(m 2/3– n 2/3+2 log+n(n)
log2 n logm).
acknowledgement: The first author is pleased to acknowledge partial support by the
Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the National Science Foundation
under Grant CCR-8714565. Work on this paper by the third author has been supported
by Office of Naval Research Grant N00014-82-K-0381, by National Science Foundation
Grant DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM
Corporation, and by a research grant from the NCRD-the Israeli National Council
for Research and Development. A preliminary version of this paper has appeared in
theProceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 44–55.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many
faces in arrangements of lines and of segments. Discrete & Computational
Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784
apa: Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity and construction
of many faces in arrangements of lines and of segments. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02187784
chicago: Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity
and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete
& Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187784.
ieee: H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction
of many faces in arrangements of lines and of segments,” Discrete & Computational
Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
ista: Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction
of many faces in arrangements of lines and of segments. Discrete & Computational
Geometry. 5(1), 161–196.
mla: Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces
in Arrangements of Lines and of Segments.” Discrete & Computational Geometry,
vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.
short: H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry
5 (1990) 161–196.
date_created: 2018-12-11T12:06:46Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-22T09:27:30Z
day: '01'
doi: 10.1007/BF02187784
extern: '1'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02187784
month: '01'
oa_version: None
page: 161 - 196
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2053'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The complexity and construction of many faces in arrangements of lines and
of segments
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 5
year: '1990'
...