---
_id: '3465'
abstract:
- lang: eng
text: Asymmetrical displacement currents and Na currents of single myelinated nerve
fibers of Xenopus laevis were studied in the temperature range from 5 to 24 degrees
C. The time constant of the on-response at E = 4 mV, tau on, was strongly temperature
dependent, whereas the amount of displaced charge at E = 39 mV, Qon, was only
slightly temperature dependent. The mean Q10 for tau on-1 was 2.54, the mean Q10
for Qon was 1.07. The time constant of charge immobilization, tau i, at E = 4
mV varied significantly (alpha = 0.001) with temperature. The mean Q10 for tau
i-1 was 2.71 +/- 0.38. The time constants of immobilization of gating charge and
of fast inactivation of Na permeability were similar in the temperature range
from 6 to 22 degrees C. The Qoff/Qon ratio for E = 4 mV pulses of 0.5 msec duration
decreased with increasing temperature. The temperature dependence of the time
constant of the off-response could not be described by a single Q10 value, since
the Q10 depended on the duration of the test pulse. Increasing temperature shifted
Qon (E) curves to more negative potentials by 0.51 mV K-1, but shifted PNa (E)
curves and h infinity (E) curves to more positive potentials by 0.43 and 0.57
mV K-1, respectively. h infinity (E = -70 mV) increased monotonously with increasing
temperature. The present data indicate that considerable entropy changes may occur
when the Na channel molecule passes from closed through open to inactivated states.
article_processing_charge: No
article_type: original
author:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Jonas PM. Temperature dependence of gating current in myelinated nerve fibers.
Journal of Membrane Biology. 1989;112(3):277-289. doi:10.1007/BF01870958
apa: Jonas, P. M. (1989). Temperature dependence of gating current in myelinated
nerve fibers. Journal of Membrane Biology. Springer. https://doi.org/10.1007/BF01870958
chicago: Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated
Nerve Fibers.” Journal of Membrane Biology. Springer, 1989. https://doi.org/10.1007/BF01870958.
ieee: P. M. Jonas, “Temperature dependence of gating current in myelinated nerve
fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289,
1989.
ista: Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve
fibers. Journal of Membrane Biology. 112(3), 277–289.
mla: Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve
Fibers.” Journal of Membrane Biology, vol. 112, no. 3, Springer, 1989,
pp. 277–89, doi:10.1007/BF01870958.
short: P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.
date_created: 2018-12-11T12:03:28Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-15T08:59:02Z
day: '01'
doi: 10.1007/BF01870958
extern: '1'
external_id:
pmid:
- '2559205 '
intvolume: ' 112'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01870958
month: '12'
oa_version: None
page: 277 - 289
pmid: 1
publication: Journal of Membrane Biology
publication_identifier:
eissn:
- 1432-1424
issn:
- 0022-2631
publication_status: published
publisher: Springer
publist_id: '2922'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temperature dependence of gating current in myelinated nerve fibers
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 112
year: '1989'
...
---
_id: '3466'
abstract:
- lang: eng
text: Amphibian myelinated nerve fibers were treated with collagenase and protease.
Axons with retraction of the myelin sheath were patch-clamped in the nodal and
paranodal region. One type of Na channel was found. It has a single-channel conductance
of 11 pS (15 degrees C) and is blocked by tetrodotoxin. Averaged events show the
typical activation and inactivation kinetics of macroscopic Na current. Three
potential-dependent K channels were identified (I, F, and S channel). The I channel,
being the most frequent type, has a single-channel conductance of 23 pS (inward
current, 105 mM K on both sides of the membrane), activates between -60 and -30
mV, deactivates with intermediate kinetics, and is sensitive to dendrotoxin. The
F channel has a conductance of 30 pS, activates between -40 and 60 mV, and deactivates
with fast kinetics. The former inactivates within tens of seconds; the latter
inactivates within seconds. The third type, the S channel, has a conductance of
7 pS and deactivates slowly. All three channels can be blocked by external tetraethylammonium
chloride. We suggest that these distinct K channel types form the basis for the
different components of macroscopic K current described previously.
acknowledgement: We thank Drs. C. Baumann, D. Siemen, and W. Stuhmer for reading the
manuscript and Dr. F. Dreyer for the generous gift of DTX. The study was supported
by the Deutsche Forschungsgemeinschaft.
article_processing_charge: No
article_type: original
author:
- 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: Michael
full_name: Bräu, Michael
last_name: Bräu
- first_name: Markus
full_name: Hermsteiner, Markus
last_name: Hermsteiner
- first_name: Werner
full_name: Vogel, Werner
last_name: Vogel
citation:
ama: Jonas PM, Bräu M, Hermsteiner M, Vogel W. Single-channel recording in myelinated
nerve fibers reveals one type of Na channel but different K channels. PNAS.
1989;86(18):7238-7242. doi:10.1073/pnas.86.18.7238
apa: Jonas, P. M., Bräu, M., Hermsteiner, M., & Vogel, W. (1989). Single-channel
recording in myelinated nerve fibers reveals one type of Na channel but different
K channels. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.86.18.7238
chicago: Jonas, Peter M, Michael Bräu, Markus Hermsteiner, and Werner Vogel. “Single-Channel
Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different
K Channels.” PNAS. National Academy of Sciences, 1989. https://doi.org/10.1073/pnas.86.18.7238.
ieee: P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording
in myelinated nerve fibers reveals one type of Na channel but different K channels,”
PNAS, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989.
ista: Jonas PM, Bräu M, Hermsteiner M, Vogel W. 1989. Single-channel recording in
myelinated nerve fibers reveals one type of Na channel but different K channels.
PNAS. 86(18), 7238–7242.
mla: Jonas, Peter M., et al. “Single-Channel Recording in Myelinated Nerve Fibers
Reveals One Type of Na Channel but Different K Channels.” PNAS, vol. 86,
no. 18, National Academy of Sciences, 1989, pp. 7238–42, doi:10.1073/pnas.86.18.7238.
short: P.M. Jonas, M. Bräu, M. Hermsteiner, W. Vogel, PNAS 86 (1989) 7238–7242.
date_created: 2018-12-11T12:03:28Z
date_published: 1989-09-01T00:00:00Z
date_updated: 2022-02-14T16:12:33Z
day: '01'
doi: 10.1073/pnas.86.18.7238
extern: '1'
external_id:
pmid:
- '2550937 '
intvolume: ' 86'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC298032/?tool=pubmed
month: '09'
oa: 1
oa_version: Published Version
page: 7238 - 7242
pmid: 1
publication: PNAS
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '2921'
quality_controlled: '1'
status: public
title: Single-channel recording in myelinated nerve fibers reveals one type of Na
channel but different K channels
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 86
year: '1989'
...
---
_id: '3549'
abstract:
- lang: eng
text: 'We study three types of spatial triangulations: Delaunay triangulations,
triangulations with non-obtuse dihedral angles, and KJ-triangulations. The latter
satisfy a certain angle condition useful for finite element approximation. We
show that the condition for Delaunay triangulations is incomparable with the other
two conditions, and that triangulations with non-obtuse dihedral angles are necessarily
also KJ-triangulations. These relationships are in sharp contrast to the ones
in the planar case. '
acknowledgement: 'Research was supported by the National Science Foundation under
grant CCR-8714565. The author thanks Thomas Kerkhoven, Raimund Seidel, and Peter
Shor for helpful discussions on the material of this paper. '
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
citation:
ama: 'Edelsbrunner H. Spatial triangulations with dihedral angle conditions. In:
Institute of the Electronics, Information and Communication Enginneers; 1989:83-89.'
apa: Edelsbrunner, H. (1989). Spatial triangulations with dihedral angle conditions
(pp. 83–89). Presented at the International Workshop on Discrete Algorithms and
Complexity, Institute of the Electronics, Information and Communication Enginneers.
chicago: Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,”
83–89. Institute of the Electronics, Information and Communication Enginneers,
1989.
ieee: H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,”
presented at the International Workshop on Discrete Algorithms and Complexity,
1989, pp. 83–89.
ista: Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions.
International Workshop on Discrete Algorithms and Complexity, 83–89.
mla: Edelsbrunner, Herbert. Spatial Triangulations with Dihedral Angle Conditions.
Institute of the Electronics, Information and Communication Enginneers, 1989,
pp. 83–89.
short: H. Edelsbrunner, in:, Institute of the Electronics, Information and Communication
Enginneers, 1989, pp. 83–89.
conference:
name: International Workshop on Discrete Algorithms and Complexity
date_created: 2018-12-11T12:03:54Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-14T14:34:06Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=32670&item_no=1&page_id=13&block_id=8
month: '01'
oa_version: None
page: 83 - 89
publication_status: published
publisher: Institute of the Electronics, Information and Communication Enginneers
publist_id: '2836'
quality_controlled: '1'
status: public
title: Spatial triangulations with dihedral angle conditions
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1989'
...
---
_id: '3652'
abstract:
- lang: eng
text: Frequency-dependent selection against rare forms can maintain clines. For
weak selection, s, in simple linear models of frequency-dependence, single locus
clines are stabilized with a maximum slope of between square root of s/square
root of 8 sigma and square root of s/square root of 12 delta, where sigma is the
dispersal distance. These clines are similar to those maintained by heterozygote
disadvantage. Using computer simulations, the weak-selection analytical results
are extended to higher selection pressures with up to three unlinked genes. Graphs
are used to display the effect of selection, migration, dominance, and number
of loci on cline widths, speeds of cline movements, two-way gametic correlations
("linkage disequilibria"), and heterozygote deficits. The effects of changing
the order of reproduction, migration, and selection, are also briefly explored.
Epistasis can also maintain tension zones. We show that epistatic selection is
similar in its effects to frequency-dependent selection, except that the disequilibria
produced in the zone will be higher for a given level of selection. If selection
consists of a mixture of frequency-dependence and epistasis, as is likely in nature,
the error made in estimating selection is usually less than twofold. From the
graphs, selection and migration can be estimated using knowledge of the dominance
and number of genes, of gene frequencies and of gametic correlations from a hybrid
zone.
acknowledgement: "The publication costs of this article were partly defrayed by the
payment of page charges. This article must therefore be hereby marked “advertisment”
in accordance with 18 U.S.C. §1734 solely to indicate this fact. \r\n\r\nWe thank
the Natural Environmental Research Council for financial support, and N. SANDERSON,
M. SLATKIN and an anonymous reviewer for comments on the manuscript."
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
citation:
ama: Mallet J, Barton NH. Inference from clines stabilized by frequency-dependent
selection. Genetics. 1989;122(4):967-976. doi:10.1093/genetics/122.4.967
apa: Mallet, J., & Barton, N. H. (1989). Inference from clines stabilized by
frequency-dependent selection. Genetics. Genetics Society of America. https://doi.org/10.1093/genetics/122.4.967
chicago: Mallet, James, and Nicholas H Barton. “Inference from Clines Stabilized
by Frequency-Dependent Selection.” Genetics. Genetics Society of America,
1989. https://doi.org/10.1093/genetics/122.4.967.
ieee: J. Mallet and N. H. Barton, “Inference from clines stabilized by frequency-dependent
selection,” Genetics, vol. 122, no. 4. Genetics Society of America, pp.
967–976, 1989.
ista: Mallet J, Barton NH. 1989. Inference from clines stabilized by frequency-dependent
selection. Genetics. 122(4), 967–976.
mla: Mallet, James, and Nicholas H. Barton. “Inference from Clines Stabilized by
Frequency-Dependent Selection.” Genetics, vol. 122, no. 4, Genetics Society
of America, 1989, pp. 967–76, doi:10.1093/genetics/122.4.967.
short: J. Mallet, N.H. Barton, Genetics 122 (1989) 967–976.
date_created: 2018-12-11T12:04:27Z
date_published: 1989-08-01T00:00:00Z
date_updated: 2022-02-14T14:07:12Z
day: '01'
doi: 10.1093/genetics/122.4.967
extern: '1'
external_id:
pmid:
- '2759433'
intvolume: ' 122'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203771
month: '08'
oa: 1
oa_version: None
page: 967 - 976
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2731'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inference from clines stabilized by frequency-dependent selection
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 122
year: '1989'
...
---
_id: '3653'
abstract:
- lang: eng
text: 'Frequency-dependent selection on warning color can maintain narrow hybrid
zones between unpalatable prey taxa. To measure such selection, we transferred
marked Heliconius erato (Lepidoptera: Nymphalidae) in both directions across a
10-km-wide hybrid zone between Peruvian races differing in color pattern. These
experimental H. erato were released at four sites, along with control H. erato
of the phenotype native to each site. Survival of experimental butterflies was
significantly lower than that of controls at two sites and overall. Most selection,
measured as differences in survival, occurred soon after release. Selection against
foreign morphs was 52% (confidence limits: 25-71%) and was probably due to bird
attacks on unusual warning-color morphs (more than 10% of the recaptures had beak
marks). Since only three major loci determine the color-pattern differences, this
suggests an average selection coefficient of 0.17 per locus, sufficient to maintain
the narrow clines in H. erato.'
acknowledgement: We thank G.Lamas for sharing his knowledge of the Tarapoto hybrid
zone; M.A.Arboleda, H.Eeley, S.Knapp, M.Muedas, and J.Santisteban for their help
in the field; P.Donnelly and C.Smith for statistical advice; and S.Jones, S.Knapp,
G.Lamas, and the reviewers for helpful comments on the manuscript. We are grateful
to the Natural Environment Research Council, the Royal Society, and the Nuffield
Foundation for funding this research.
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
citation:
ama: Mallet J, Barton NH. Strong natural selection in a warning color hybrid zone.
Evolution. 1989;43(2):421-431. doi:10.2307/2409217
apa: Mallet, J., & Barton, N. H. (1989). Strong natural selection in a warning
color hybrid zone. Evolution. Wiley-Blackwell. https://doi.org/10.2307/2409217
chicago: Mallet, James, and Nicholas H Barton. “Strong Natural Selection in a Warning
Color Hybrid Zone.” Evolution. Wiley-Blackwell, 1989. https://doi.org/10.2307/2409217 .
ieee: J. Mallet and N. H. Barton, “Strong natural selection in a warning color hybrid
zone,” Evolution, vol. 43, no. 2. Wiley-Blackwell, pp. 421–431, 1989.
ista: Mallet J, Barton NH. 1989. Strong natural selection in a warning color hybrid
zone. Evolution. 43(2), 421–431.
mla: Mallet, James, and Nicholas H. Barton. “Strong Natural Selection in a Warning
Color Hybrid Zone.” Evolution, vol. 43, no. 2, Wiley-Blackwell, 1989, pp.
421–31, doi:10.2307/2409217 .
short: J. Mallet, N.H. Barton, Evolution 43 (1989) 421–431.
date_created: 2018-12-11T12:04:27Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-14T11:00:42Z
day: '01'
doi: '10.2307/2409217 '
extern: '1'
external_id:
pmid:
- '28568556 '
intvolume: ' 43'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.jstor.org/stable/2409217?origin=crossref&seq=1#metadata_info_tab_contents
month: '01'
oa_version: None
page: 421 - 431
pmid: 1
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2730'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strong natural selection in a warning color hybrid zone
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1989'
...
---
_id: '3654'
abstract:
- lang: eng
text: Many species are divided into a mosaic of genetically distinct populations,
separated by narrow zones of hybridization. Studies of hybrid zones allow us to
quantify the genetic differences responsible for speciation, to measure the diffusion
of genes between diverging taxa, and to understand the spread of alternative adaptations.
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
- first_name: Godfrey
full_name: Hewitt, Godfrey
last_name: Hewitt
citation:
ama: Barton NH, Hewitt G. Adaptation, speciation and hybrid zones. Nature.
1989;341:497-503. doi:10.1038/341497a0
apa: Barton, N. H., & Hewitt, G. (1989). Adaptation, speciation and hybrid zones.
Nature. Nature Publishing Group. https://doi.org/10.1038/341497a0
chicago: Barton, Nicholas H, and Godfrey Hewitt. “Adaptation, Speciation and Hybrid
Zones.” Nature. Nature Publishing Group, 1989. https://doi.org/10.1038/341497a0.
ieee: N. H. Barton and G. Hewitt, “Adaptation, speciation and hybrid zones,” Nature,
vol. 341. Nature Publishing Group, pp. 497–503, 1989.
ista: Barton NH, Hewitt G. 1989. Adaptation, speciation and hybrid zones. Nature.
341, 497–503.
mla: Barton, Nicholas H., and Godfrey Hewitt. “Adaptation, Speciation and Hybrid
Zones.” Nature, vol. 341, Nature Publishing Group, 1989, pp. 497–503, doi:10.1038/341497a0.
short: N.H. Barton, G. Hewitt, Nature 341 (1989) 497–503.
date_created: 2018-12-11T12:04:27Z
date_published: 1989-10-12T00:00:00Z
date_updated: 2022-02-14T10:13:44Z
day: '12'
doi: 10.1038/341497a0
extern: '1'
external_id:
pmid:
- '2677747 '
intvolume: ' 341'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/341497a0
month: '10'
oa_version: None
page: 497 - 503
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '2729'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adaptation, speciation and hybrid zones
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 341
year: '1989'
...
---
_id: '4079'
acknowledgement: Research supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862
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: Steven
full_name: Skiena, Steven
last_name: Skiena
citation:
ama: Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point
set. American Mathematical Monthly. 1989;96(7):614-618. doi:10.1080/00029890.1989.11972250
apa: Edelsbrunner, H., & Skiena, S. (1989). On the number of furthest neighbor
pairs in a point set. American Mathematical Monthly. Mathematical Association
of America. https://doi.org/10.1080/00029890.1989.11972250
chicago: Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor
Pairs in a Point Set.” American Mathematical Monthly. Mathematical Association
of America, 1989. https://doi.org/10.1080/00029890.1989.11972250.
ieee: H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in
a point set,” American Mathematical Monthly, vol. 96, no. 7. Mathematical
Association of America, pp. 614–618, 1989.
ista: Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in
a point set. American Mathematical Monthly. 96(7), 614–618.
mla: Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor
Pairs in a Point Set.” American Mathematical Monthly, vol. 96, no. 7, Mathematical
Association of America, 1989, pp. 614–18, doi:10.1080/00029890.1989.11972250.
short: H. Edelsbrunner, S. Skiena, American Mathematical Monthly 96 (1989) 614–618.
date_created: 2018-12-11T12:06:49Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-11T12:59:01Z
day: '01'
doi: 10.1080/00029890.1989.11972250
extern: '1'
intvolume: ' 96'
issue: '7'
language:
- iso: eng
main_file_link:
- url: 'http://www.jstor.org/stable/2325182 '
month: '01'
oa_version: None
page: 614 - 618
publication: American Mathematical Monthly
publication_identifier:
eissn:
- 1930-0972
issn:
- 0002-9890
publication_status: published
publisher: Mathematical Association of America
publist_id: '2042'
quality_controlled: '1'
status: public
title: On the number of furthest neighbor pairs in a point set
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 96
year: '1989'
...
---
_id: '4080'
abstract:
- lang: eng
text: This paper proves that any set of n points in the plane contains two points
such that any circle through those two points encloses at least n12−112+O(1)n47 points
of the set. The main ingredients used in the proof of this result are edge counting
formulas for k-order Voronoi diagrams and a lower bound on the minimum number
of semispaces of size at most k.
acknowledgement: Work on this paper by the first author has been supported by Amoco
Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under
Grant CCR-8714565, by the second author has been partially supported by the Digital
Equipment Corporation, by the fourth author has been partially supported by the
Office of Naval Research under Grant N00014-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: Nany
full_name: Hasan, Nany
last_name: Hasan
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Xiao
full_name: Shen, Xiao
last_name: Shen
citation:
ama: Edelsbrunner H, Hasan N, Seidel R, Shen X. Circles through two points that
always enclose many points. Geometriae Dedicata. 1989;32(1):1-12. doi:10.1007/BF00181432
apa: Edelsbrunner, H., Hasan, N., Seidel, R., & Shen, X. (1989). Circles through
two points that always enclose many points. Geometriae Dedicata. Springer.
https://doi.org/10.1007/BF00181432
chicago: Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles
through Two Points That Always Enclose Many Points.” Geometriae Dedicata.
Springer, 1989. https://doi.org/10.1007/BF00181432.
ieee: H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points
that always enclose many points,” Geometriae Dedicata, vol. 32, no. 1.
Springer, pp. 1–12, 1989.
ista: Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points
that always enclose many points. Geometriae Dedicata. 32(1), 1–12.
mla: Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose
Many Points.” Geometriae Dedicata, vol. 32, no. 1, Springer, 1989, pp.
1–12, doi:10.1007/BF00181432.
short: H. Edelsbrunner, N. Hasan, R. Seidel, X. Shen, Geometriae Dedicata 32 (1989)
1–12.
date_created: 2018-12-11T12:06:49Z
date_published: 1989-10-01T00:00:00Z
date_updated: 2022-02-14T09:55:28Z
day: '01'
doi: 10.1007/BF00181432
extern: '1'
intvolume: ' 32'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF00181432
month: '10'
oa_version: None
page: 1 - 12
publication: Geometriae Dedicata
publication_identifier:
eissn:
- 1572-9168
issn:
- 0046-5755
publication_status: published
publisher: Springer
publist_id: '2043'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Circles through two points that always enclose many points
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 32
year: '1989'
...
---
_id: '4081'
abstract:
- lang: eng
text: This paper studies applications of envelopes of piecewise linear functions
to problems in computational geometry. Among these applications we find problems
involving hidden line/surface elimination, motion planning, transversals of polytopes,
and a new type of Voronoi diagram for clusters of points. All results are either
combinatorial or computational in nature. They are based on the combinatorial
analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm
for computing envelopes described in this paper.
acknowledgement: Work on this paper by the first author has been supported by Amoco
Fnd. Fac. Dev. Comput. Sci. 1-6-44862. Work by the third author has been supported
by the Office of Naval Research Grant N00014-82-K-0381, National Science Foundation
Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and
the IBM Corporation, and by a research grant from NCRD, the Israeli National Council
for Research and Development.
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 upper envelope of piecewise linear
functions: Algorithms and applications. Discrete & Computational Geometry.
1989;4(1):311-336. doi:10.1007/BF02187733'
apa: 'Edelsbrunner, H., Guibas, L., & Sharir, M. (1989). The upper envelope
of piecewise linear functions: Algorithms and applications. Discrete &
Computational Geometry. Springer. https://doi.org/10.1007/BF02187733'
chicago: 'Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope
of Piecewise Linear Functions: Algorithms and Applications.” Discrete &
Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187733.'
ieee: 'H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise
linear functions: Algorithms and applications,” Discrete & Computational
Geometry, vol. 4, no. 1. Springer, pp. 311–336, 1989.'
ista: 'Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise
linear functions: Algorithms and applications. Discrete & Computational Geometry.
4(1), 311–336.'
mla: 'Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions:
Algorithms and Applications.” Discrete & Computational Geometry, vol.
4, no. 1, Springer, 1989, pp. 311–36, doi:10.1007/BF02187733.'
short: H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry
4 (1989) 311–336.
date_created: 2018-12-11T12:06:50Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-10T15:53:48Z
day: '01'
doi: 10.1007/BF02187733
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187733
month: '12'
oa: 1
oa_version: Published Version
page: 311 - 336
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2038'
quality_controlled: '1'
status: public
title: 'The upper envelope of piecewise linear functions: Algorithms and applications'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4082'
abstract:
- lang: eng
text: Sweeping a collection of figures in the Euclidean plane with a straight line
is one of the novel algorithmic paradigms that have emerged in the field of computational
geometry. In this paper we demonstrate the advantages of sweeping with a topological
line that is not necessarily straight. We show how an arrangement of n lines in
the plane can be swept over in O(n2) time and O(n) space by a such a line. In
the process each element, i.e., vertex, edge, or region, is visited once in a
consistent ordering. Our technique makes use of novel data structures which exhibit
interesting amortized complexity behavior; the result is an algorithm that improves
upon all its predecessors either in the space or the time bounds, as well as being
eminently practical. Numerous applications of the technique to problems in computational
geometry are given—many through the use of duality transforms. Examples include
solving visibility problems, detecting degeneracies in configurations, computing
the extremal shadows of convex polytopes, and others. Even though our basic technique
solves a planar problem, its applications include several problems in higher dimensions.
acknowledgement: he authors wish to thank Raimund Seidel for suggesting the argument
that we used to prove Theorem 3.1, Harald Rosenberger who implemented the topological
sweep and compared it with a straight line sweep, the students who took the Stanford
1985 analysis of algorithms qualifying examination and suffered through a version
of this problem, and finally Lyle Ramshaw and Cynthia Hibbard for their detailed
reading and comments on the manuscript. The constructive criticism of an anonymous
referee is also appreciated.
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
citation:
ama: Edelsbrunner H, Guibas L. Topologically sweeping an arrangement. Journal
of Computer and System Sciences. 1989;38(1):165-194. doi:10.1016/0022-0000(89)90038-X
apa: Edelsbrunner, H., & Guibas, L. (1989). Topologically sweeping an arrangement.
Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/0022-0000(89)90038-X
chicago: Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an
Arrangement.” Journal of Computer and System Sciences. Elsevier, 1989.
https://doi.org/10.1016/0022-0000(89)90038-X.
ieee: H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” Journal
of Computer and System Sciences, vol. 38, no. 1. Elsevier, pp. 165–194, 1989.
ista: Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal
of Computer and System Sciences. 38(1), 165–194.
mla: Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.”
Journal of Computer and System Sciences, vol. 38, no. 1, Elsevier, 1989,
pp. 165–94, doi:10.1016/0022-0000(89)90038-X.
short: H. Edelsbrunner, L. Guibas, Journal of Computer and System Sciences 38 (1989)
165–194.
date_created: 2018-12-11T12:06:50Z
date_published: 1989-02-01T00:00:00Z
date_updated: 2022-02-10T16:06:05Z
day: '01'
doi: 10.1016/0022-0000(89)90038-X
extern: '1'
intvolume: ' 38'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/002200008990038X?via%3Dihub
month: '02'
oa: 1
oa_version: Published Version
page: 165 - 194
publication: Journal of Computer and System Sciences
publication_identifier:
eissn:
- 1090-2724
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
publist_id: '2039'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topologically sweeping an arrangement
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 38
year: '1989'
...
---
_id: '4083'
abstract:
- lang: eng
text: 'It is shown that, given a set S of n points in $R^3 $, one can always find
three planes that form an eight-partition of S, that is, a partition where at
most ${n / 8}$ points of S lie in each of the eight open regions. This theorem
is used to define a data structure, called an octant tree, for representing any
point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can
be constructed in polynomial time. With this data structure and its refinements,
efficient solutions to various range query problems in two and three dimensions
can be obtained, including (1) half-space queries: find all points of S that lie
to one side of any given plane; (2) polyhedron queries: find all points that lie
inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a
planar set S, find all points that lie inside (outside) any given circle. The
retrieval time for all these queries is $T(n) = O(n^\alpha + m)$, where $\alpha
= 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance
is the best currently known for linear-space data structures that can be deterministically
constructed in polynomial time.'
article_processing_charge: No
article_type: original
author:
- first_name: F.
full_name: Yao, F.
last_name: Yao
- 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: Michael
full_name: Paterson, Michael
last_name: Paterson
citation:
ama: Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries.
SIAM Journal on Computing. 1989;18(2):371-384. doi:10.1137/0218025
apa: Yao, F., Dobkin, D., Edelsbrunner, H., & Paterson, M. (1989). Partitioning
space for range queries. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0218025
chicago: Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning
Space for Range Queries.” SIAM Journal on Computing. SIAM, 1989. https://doi.org/10.1137/0218025.
ieee: F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for
range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384,
1989.
ista: Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for
range queries. SIAM Journal on Computing. 18(2), 371–384.
mla: Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on
Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
short: F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing
18 (1989) 371–384.
date_created: 2018-12-11T12:06:50Z
date_published: 1989-04-01T00:00:00Z
date_updated: 2022-02-11T07:55:48Z
day: '01'
doi: 10.1137/0218025
extern: '1'
intvolume: ' 18'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://epubs.siam.org/doi/10.1137/0218025
month: '04'
oa: 1
oa_version: Published Version
page: 371 - 384
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2040'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partitioning space for range queries
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 18
year: '1989'
...
---
_id: '4084'
abstract:
- lang: eng
text: "A tour of a finite set P of points is a necklace-tour if there are disks
with the points in P as centers such that two disks intersect if and only if their
centers are adjacent in . It has been observed by Sanders that a necklace-tour
is an optimal traveling salesman tour.\r\n\r\nIn this paper, we present an algorithm
that either reports that no necklace-tour exists or outputs a necklace-tour of
a given set of n points in O(n2 log n) time. If a tour is given, then we can test
in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can
be generalized to ƒ-factors of point sets in the plane. The complexity results
rely on a combinatorial analysis of certain intersection graphs of disks defined
for finite sets of points in the plane."
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: Günter
full_name: Rote, Günter
last_name: Rote
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest
tours and optimal factors in the plane. Theoretical Computer Science. 1989;66(2):157-180.
doi:10.1016/0304-3975(89)90133-3
apa: Edelsbrunner, H., Rote, G., & Welzl, E. (1989). Testing the necklace condition
for shortest tours and optimal factors in the plane. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/0304-3975(89)90133-3
chicago: Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace
Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical
Computer Science. Elsevier, 1989. https://doi.org/10.1016/0304-3975(89)90133-3.
ieee: H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for
shortest tours and optimal factors in the plane,” Theoretical Computer Science,
vol. 66, no. 2. Elsevier, pp. 157–180, 1989.
ista: Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for
shortest tours and optimal factors in the plane. Theoretical Computer Science.
66(2), 157–180.
mla: Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest
Tours and Optimal Factors in the Plane.” Theoretical Computer Science,
vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
short: H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989)
157–180.
date_created: 2018-12-11T12:06:51Z
date_published: 1989-08-01T00:00:00Z
date_updated: 2022-02-11T11:15:43Z
day: '01'
doi: 10.1016/0304-3975(89)90133-3
extern: '1'
intvolume: ' 66'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/0304397589901333?via%3Dihub
month: '08'
oa: 1
oa_version: Published Version
page: 157 - 180
publication: Theoretical Computer Science
publication_identifier:
eissn:
- 1879-2294
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '2041'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Testing the necklace condition for shortest tours and optimal factors in the
plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 66
year: '1989'
...
---
_id: '4085'
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.
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
citation:
ama: 'Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. In:
Proceedings of the 5th Annual Symposium on Computational Geometry. ACM;
1989:145-151. doi:10.1145/73833.73850'
apa: 'Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension.
In Proceedings of the 5th annual symposium on Computational geometry (pp.
145–151). Saarbruchen, Germany: ACM. https://doi.org/10.1145/73833.73850'
chicago: Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”
In Proceedings of the 5th Annual Symposium on Computational Geometry, 145–51.
ACM, 1989. https://doi.org/10.1145/73833.73850.
ieee: H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,”
in Proceedings of the 5th annual symposium on Computational geometry, Saarbruchen,
Germany, 1989, pp. 145–151.
ista: 'Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension.
Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium
on Computational Geometry, 145–151.'
mla: Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”
Proceedings of the 5th Annual Symposium on Computational Geometry, ACM,
1989, pp. 145–51, doi:10.1145/73833.73850.
short: H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational
Geometry, ACM, 1989, pp. 145–151.
conference:
end_date: 1989-06-07
location: Saarbruchen, Germany
name: 'SCG: Symposium on Computational Geometry'
start_date: 1989-06-05
date_created: 2018-12-11T12:06:51Z
date_published: 1989-06-01T00:00:00Z
date_updated: 2022-02-10T10:56:49Z
day: '01'
doi: 10.1145/73833.73850
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/73833.73850
month: '06'
oa_version: None
page: 145 - 151
publication: Proceedings of the 5th annual symposium on Computational geometry
publication_identifier:
isbn:
- 978-0-89791-318-8
publication_status: published
publisher: ACM
publist_id: '2033'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An acyclicity theorem for cell complexes in d dimension
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1989'
...
---
_id: '4086'
abstract:
- lang: eng
text: This note proves that the maximum number of faces (of any dimension) of the
upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions
is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove
the same bound for the number ofd-dimensional faces of the upper envelope.
acknowledgement: "This work was supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862
and by the National Science Foundation under Grant CCR-8714565. Research on the
presented result was partially carried out while the author worked for the IBM T.
J. Watson Research Center at Yorktown Height, New York, USA. \r\n"
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. The upper envelope of piecewise linear functions: Tight bounds
on the number of faces . Discrete & Computational Geometry. 1989;4(4):337-343.
doi:10.1007/BF02187734'
apa: 'Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions:
Tight bounds on the number of faces . Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/BF02187734'
chicago: 'Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions:
Tight Bounds on the Number of Faces .” Discrete & Computational Geometry.
Springer, 1989. https://doi.org/10.1007/BF02187734.'
ieee: 'H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight
bounds on the number of faces ,” Discrete & Computational Geometry,
vol. 4, no. 4. Springer, pp. 337–343, 1989.'
ista: 'Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight
bounds on the number of faces . Discrete & Computational Geometry. 4(4), 337–343.'
mla: 'Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions:
Tight Bounds on the Number of Faces .” Discrete & Computational Geometry,
vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.'
short: H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
date_created: 2018-12-11T12:06:51Z
date_published: 1989-11-01T00:00:00Z
date_updated: 2022-02-10T11:08:12Z
day: '01'
doi: 10.1007/BF02187734
extern: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187734
month: '11'
oa: 1
oa_version: Published Version
page: 337 - 343
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2034'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The upper envelope of piecewise linear functions: Tight bounds on the number
of faces '
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4087'
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 coplanar. It also presents
an algorithm that in O(nlog 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. Dev.
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 8504
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: 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.
In: International Symposium on Symbolic and Algebraic Computation. Vol
358. Springer; 1989:315-331. doi:10.1007/3-540-51084-2_31'
apa: 'Edelsbrunner, H., Preparata, F., & West, D. (1989). Tetrahedrizing point
sets in three dimensions. In International Symposium on Symbolic and Algebraic
Computation (Vol. 358, pp. 315–331). Rome, Italy: Springer. https://doi.org/10.1007/3-540-51084-2_31'
chicago: Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing
Point Sets in Three Dimensions.” In International Symposium on Symbolic and
Algebraic Computation, 358:315–31. Springer, 1989. https://doi.org/10.1007/3-540-51084-2_31.
ieee: H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in
three dimensions,” in International Symposium on Symbolic and Algebraic Computation,
Rome, Italy, 1989, vol. 358, pp. 315–331.
ista: 'Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three
dimensions. International Symposium on Symbolic and Algebraic Computation. ISSAC:
International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358,
315–331.'
mla: Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.”
International Symposium on Symbolic and Algebraic Computation, vol. 358,
Springer, 1989, pp. 315–31, doi:10.1007/3-540-51084-2_31.
short: H. Edelsbrunner, F. Preparata, D. West, in:, International Symposium on
Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.
conference:
end_date: 1988-07-08
location: Rome, Italy
name: 'ISSAC: International Symposium on Symbolic and Algebraic Computation'
start_date: 1988-07-04
date_created: 2018-12-11T12:06:52Z
date_published: 1989-09-20T00:00:00Z
date_updated: 2022-02-10T13:27:41Z
day: '20'
doi: 10.1007/3-540-51084-2_31
extern: '1'
intvolume: ' 358'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/3-540-51084-2_31
month: '09'
oa_version: None
page: 315 - 331
publication: ' International Symposium on Symbolic and Algebraic Computation'
publication_status: published
publisher: Springer
publist_id: '2035'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tetrahedrizing point sets in three dimensions
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 358
year: '1989'
...
---
_id: '4088'
abstract:
- lang: eng
text: 'Anarrangement ofn lines (or line segments) in the plane is the partition
of the plane defined by these objects. Such an arrangement consists ofO(n 2) regions,
calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly,
using subquadratic space and preprocessing, so that, given any query pointp, we
can calculate efficiently the face containingp. First, we consider the case of
lines and show that with (n) space1 and (n 3/2) preprocessing time, we can answer
face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved
with high probability.) In the process, we solve three interesting subproblems:
(1) given a set ofn points, find a straight-edge spanning tree of these points
such that any line intersects only a few edges of the tree, (2) given a simple
polygonal path , form a data structure from which we can find the convex hull
of any subpath of quickly, and (3) given a set of points, organize them so that
the convex hull of their subset lying above a query line can be found quickly.
Second, using random sampling, we give a tradeoff between increasing space and
decreasing query time. Third, we extend our structure to report faces in an arrangement
of line segments in (n 1/3)+O(K) time, given(n 4/3) space and (n 5/3) preprocessing
time. Lastly, we note that our techniques allow us to computem faces in an arrangement
ofn lines in time (m 2/3 n 2/3+n), which is nearly optimal.'
acknowledgement: The first author is pleased to acknowledge the support of Amoco Fnd.
Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565.
Work on this paper by the fifth author has been supported by Office of Naval Research
Grant N00014-87-K-0129, by National Science Foundation Grant NSF-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.
The sixth author was supported in part by a National Science Foundation Graduate
Fellowship. This work was begun while the non-DEC authors were visiting at the DEC
Systems Research Center.
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: John
full_name: Hershberger, John
last_name: Hershberger
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements
of lines or segments. Discrete & Computational Geometry. 1989;4(1):433-466.
doi:10.1007/BF02187742
apa: Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink,
J., & Welzl, E. (1989). Implicitly representing arrangements of lines or segments.
Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187742
chicago: Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel,
Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements
of Lines or Segments.” Discrete & Computational Geometry. Springer,
1989. https://doi.org/10.1007/BF02187742.
ieee: H. Edelsbrunner et al., “Implicitly representing arrangements of lines
or segments,” Discrete & Computational Geometry, vol. 4, no. 1. Springer,
pp. 433–466, 1989.
ista: Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl
E. 1989. Implicitly representing arrangements of lines or segments. Discrete &
Computational Geometry. 4(1), 433–466.
mla: Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines
or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer,
1989, pp. 433–66, doi:10.1007/BF02187742.
short: H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink,
E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
date_created: 2018-12-11T12:06:52Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-10T15:03:48Z
day: '01'
doi: 10.1007/BF02187742
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187742
month: '12'
oa: 1
oa_version: Published Version
page: 433 - 466
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2036'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Implicitly representing arrangements of lines or segments
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4089'
abstract:
- lang: eng
text: Motivated by a number of motion-planning questions, we investigate in this
paper some general topological and combinatorial properties of the boundary of
the union ofn regions bounded by Jordan curves in the plane. We show that, under
some fairly weak conditions, a simply connected surface can be constructed that
exactly covers this union and whose boundary has combinatorial complexity that
is nearly linear, even though the covered region can have quadratic complexity.
In the case where our regions are delimited by Jordan acrs in the upper halfplane
starting and ending on thex-axis such that any pair of arcs intersect in at most
three points, we prove that the total number of subarcs that appear on the boundary
of the union is only (n(n)), where(n) is the extremely slowly growing functional
inverse of Ackermann's function.
acknowledgement: The first author is pleased to acknowledge the support of Amoco Fnd.
Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565.
Work on this paper by the fourth and seventh authors has been supported by Office
of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085,
and by grants from the Digital Equipment Corporation and the IBM Corporation. The
seventh author in addition wishes to acknowledge support by a research grant from
the NCRD—the Israeli National Council for Research and Development. The fifth author
would like to acknowledge support in part by NSF grant DMS-8501947. Finally, the
eighth author was supported in part by a National Science Foundation Graduate Fellowship.
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: John
full_name: Hershberger, John
last_name: Hershberger
- first_name: János
full_name: Pach, János
last_name: Pach
- first_name: Richard
full_name: Pollack, Richard
last_name: Pollack
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
citation:
ama: Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs
with three intersections per pair. Discrete & Computational Geometry.
1989;4(1):523-539. doi:10.1007/BF02187745
apa: Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel,
R., … Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections
per pair. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187745
chicago: Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard
Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of
Jordan Arcs with Three Intersections per Pair.” Discrete & Computational
Geometry. Springer, 1989. https://doi.org/10.1007/BF02187745.
ieee: H. Edelsbrunner et al., “On arrangements of Jordan arcs with three
intersections per pair,” Discrete & Computational Geometry, vol. 4,
no. 1. Springer, pp. 523–539, 1989.
ista: Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir
M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per
pair. Discrete & Computational Geometry. 4(1), 523–539.
mla: Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections
per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer,
1989, pp. 523–39, doi:10.1007/BF02187745.
short: H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel,
M. Sharir, J. Snoeyink, Discrete & Computational Geometry 4 (1989) 523–539.
date_created: 2018-12-11T12:06:52Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-10T15:40:04Z
day: '01'
doi: 10.1007/BF02187745
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187745
month: '12'
oa: 1
oa_version: Published Version
page: 523 - 539
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2037'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On arrangements of Jordan arcs with three intersections per pair
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4092'
acknowledgement: 'The support of the Digital Systems Research center and the Digital
Paris Research laboratory, where much of this research was carried out, are gratefully
acknowledged. Work on this paper by Bernard Chazelle has been supported by NSF Grant
CCI~-87-00917. Work on this paper by Herbert Edelsbrunner has been supported by
NSF Grant CCR-87-14565. Work on this paper by Micha Sharir has been supported by
ONR Grant N00014-87-K-0129, by NSF Grant DCP~-83-20085, and by grants from the U.S.-Israeli
Binational Science Foundation, the NCRD - the Israeli National Council for Research
and Development, and the EMET Fund of the Israeli Academy of Sciences. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- 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: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification
scheme for real semi-algebraic varieties and its applications. In: 16th International
Colloquium on Automata, Languages, and Programming. Vol 372. Springer; 1989:179-193.
doi:10.1007/BFb0035760'
apa: 'Chazelle, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1989). A singly
exponential stratification scheme for real semi-algebraic varieties and its applications.
In 16th International Colloquium on Automata, Languages, and Programming
(Vol. 372, pp. 179–193). Stresa, Italy: Springer. https://doi.org/10.1007/BFb0035760'
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir.
“A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties
and Its Applications.” In 16th International Colloquium on Automata, Languages,
and Programming, 372:179–93. Springer, 1989. https://doi.org/10.1007/BFb0035760.
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential
stratification scheme for real semi-algebraic varieties and its applications,”
in 16th International Colloquium on Automata, Languages, and Programming,
Stresa, Italy, 1989, vol. 372, pp. 179–193.
ista: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential
stratification scheme for real semi-algebraic varieties and its applications.
16th International Colloquium on Automata, Languages, and Programming. ICALP:
International Colloquium on Automata, Languages, and Programming, LNCS, vol. 372,
179–193.'
mla: Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real
Semi-Algebraic Varieties and Its Applications.” 16th International Colloquium
on Automata, Languages, and Programming, vol. 372, Springer, 1989, pp. 179–93,
doi:10.1007/BFb0035760.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, in:, 16th International
Colloquium on Automata, Languages, and Programming, Springer, 1989, pp. 179–193.
conference:
end_date: 1989-07-15
location: Stresa, Italy
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 1989-07-11
date_created: 2018-12-11T12:06:53Z
date_published: 1989-07-24T00:00:00Z
date_updated: 2022-02-10T10:06:23Z
day: '24'
doi: 10.1007/BFb0035760
extern: '1'
intvolume: ' 372'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/BFb0035760
month: '07'
oa_version: None
page: 179 - 193
publication: 16th International Colloquium on Automata, Languages, and Programming
publication_status: published
publisher: Springer
publist_id: '2031'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A singly exponential stratification scheme for real semi-algebraic varieties
and its applications
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 372
year: '1989'
...
---
_id: '4093'
abstract:
- lang: eng
text: This paper investigates the combinatorial and computational aspects of certain
extremal geometric problems in two and three dimensions. Specifically, we examine
the problem of intersecting a convex subdivision with a line in order to maximize
the number of intersections. A similar problem is to maximize the number of intersected
facets in a cross-section of a three-dimensional convex polytope. Related problems
concern maximum chains in certain families of posets defined over the regions
of a convex subdivision. In most cases we are able to prove sharp bounds on the
asymptotic behavior of the corresponding extremal functions. We also describe
polynomial algorithms for all the problems discussed.
acknowledgement: "Bernard Chazelle wishes to acknowledge the National Science Foundation
for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner
is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862.
We wish to thank J. Pach and E. Szemeredi for valuable discussions on several\r\nof
the problems studied in this paper."
article_processing_charge: No
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- 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
citation:
ama: Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes.
Discrete & Computational Geometry. 1989;4(1):139-181. doi:10.1007/BF02187720
apa: Chazelle, B., Edelsbrunner, H., & Guibas, L. (1989). The complexity of
cutting complexes. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187720
chicago: Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity
of Cutting Complexes.” Discrete & Computational Geometry. Springer,
1989. https://doi.org/10.1007/BF02187720.
ieee: B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,”
Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181,
1989.
ista: Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes.
Discrete & Computational Geometry. 4(1), 139–181.
mla: Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” Discrete
& Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:10.1007/BF02187720.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete & Computational Geometry
4 (1989) 139–181.
date_created: 2018-12-11T12:06:54Z
date_published: 1989-03-01T00:00:00Z
date_updated: 2022-02-10T10:25:57Z
day: '01'
doi: 10.1007/BF02187720
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02187720
month: '03'
oa_version: None
page: 139 - 181
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2032'
quality_controlled: '1'
status: public
title: The complexity of cutting complexes
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4309'
abstract:
- lang: eng
text: Three methods for estimating the average level of gene flow in natural population
are discussed and compared. The three methods are FST, rare alleles, and maximum
likelihood. All three methods yield estimates of the combination of parameters
(the number of migrants [Nm] in a demic model or the neighborhood size [4πDσ2]
in a continuum model) that determines the relative importance of gene flow and
genetic drift. We review the theory underlying these methods and derive new analytic
results for the expectation of FST in stepping-stone and continuum models when
small sets of samples are taken. We also compare the effectiveness of the different
methods using a variety of simulated data. We found that the FST and rare-alleles
methods yield comparable estimates under a wide variety of conditions when the
population being sampled is demographically stable. They are roughly equally sensitive
to selection and to variation in population structure, and they approach their
equilibrium values at approximately the same rate. We found that two different
maximum-likelihood methods tend to yield biased estimates when relatively small
numbers of locations are sampled but more accurate estimates when larger numbers
are sampled. Our conclusion is that, although FST and rare-alleles methods are
expected to be equally effective in analyzing ideal data, practical problems in
estimating the frequencies of rare alleles in electrophoretic studies suggest
that FST is likely to be more useful under realistic conditions.
acknowledgement: This research has been supported in partv by grant 85-00258 from
the National Science Foundation and by grants GR/C/9 1529 and GR/E/08507 from the
Science and Engineering Research Council. We thank C. C. Cockerham and B. S. Weir
for helpful discussions of this topic, C. Wehrhahn for bringing his method to our
attention and for providing us with a copy of his program for estimating Nm, and
J. Coyne, M. Nei, B. S. Weir, and an anonymous referee for comments on an earlier
draft of this paper.
article_processing_charge: No
article_type: original
author:
- first_name: Montgomery
full_name: Slatkin, Montgomery
last_name: Slatkin
- 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: Slatkin M, Barton NH. A comparison of three methods for estimating average
levels of gene flow. Evolution; International Journal of Organic Evolution.
1989;43(7):1349-1368. doi:10.1111/j.1558-5646.1989.tb02587.x
apa: Slatkin, M., & Barton, N. H. (1989). A comparison of three methods for
estimating average levels of gene flow. Evolution; International Journal of
Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.1989.tb02587.x
chicago: Slatkin, Montgomery, and Nicholas H Barton. “A Comparison of Three Methods
for Estimating Average Levels of Gene Flow.” Evolution; International Journal
of Organic Evolution. Wiley-Blackwell, 1989. https://doi.org/10.1111/j.1558-5646.1989.tb02587.x .
ieee: M. Slatkin and N. H. Barton, “A comparison of three methods for estimating
average levels of gene flow,” Evolution; International Journal of Organic Evolution,
vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989.
ista: Slatkin M, Barton NH. 1989. A comparison of three methods for estimating average
levels of gene flow. Evolution; International Journal of Organic Evolution. 43(7),
1349–1368.
mla: Slatkin, Montgomery, and Nicholas H. Barton. “A Comparison of Three Methods
for Estimating Average Levels of Gene Flow.” Evolution; International Journal
of Organic Evolution, vol. 43, no. 7, Wiley-Blackwell, 1989, pp. 1349–68,
doi:10.1111/j.1558-5646.1989.tb02587.x
.
short: M. Slatkin, N.H. Barton, Evolution; International Journal of Organic Evolution
43 (1989) 1349–1368.
date_created: 2018-12-11T12:08:10Z
date_published: 1989-11-01T00:00:00Z
date_updated: 2022-02-10T09:44:53Z
day: '01'
doi: '10.1111/j.1558-5646.1989.tb02587.x '
extern: '1'
external_id:
pmid:
- '28564250 '
intvolume: ' 43'
issue: '7'
language:
- iso: eng
main_file_link:
- url: http://www.jstor.org/stable/2409452
month: '11'
oa_version: None
page: 1349 - 1368
pmid: 1
publication: Evolution; International Journal of Organic Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1751'
quality_controlled: '1'
status: public
title: A comparison of three methods for estimating average levels of gene flow
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1989'
...