---
_id: '3513'
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
citation:
ama: 'Dobkin D, Edelsbrunner H. Ham-sandwich theorems applied to intersection problems.
In: 9th International Workshop on Graph Theoretic Concepts in Computer Science.
WG. Teubner; 1984:88-99.'
apa: 'Dobkin, D., & Edelsbrunner, H. (1984). Ham-sandwich theorems applied to
intersection problems. In 9th International Workshop on Graph Theoretic Concepts
in Computer Science (pp. 88–99). Haus Ohrbeck, Germany: Teubner.'
chicago: Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied
to Intersection Problems.” In 9th International Workshop on Graph Theoretic
Concepts in Computer Science, 88–99. WG. Teubner, 1984.
ieee: D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection
problems,” in 9th International Workshop on Graph Theoretic Concepts in Computer
Science, Haus Ohrbeck, Germany, 1984, pp. 88–99.
ista: 'Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection
problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science.
WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG,
88–99.'
mla: Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to
Intersection Problems.” 9th International Workshop on Graph Theoretic Concepts
in Computer Science, Teubner, 1984, pp. 88–99.
short: D. Dobkin, H. Edelsbrunner, in:, 9th International Workshop on Graph Theoretic
Concepts in Computer Science, Teubner, 1984, pp. 88–99.
conference:
location: Haus Ohrbeck, Germany
name: 'WG: International Workshop on Graph Theoretic Concepts in Computer Science'
date_created: 2018-12-11T12:03:43Z
date_published: 1984-01-01T00:00:00Z
date_updated: 2022-01-28T12:10:55Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://pub.ist.ac.at/~edels/Papers/1984-P-06-HamSandwichTheorems.pdf
month: '01'
oa_version: None
page: 88 - 99
publication: 9th International Workshop on Graph Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- 3-853-20311-6
publication_status: published
publisher: Teubner
publist_id: '2872'
quality_controlled: '1'
series_title: WG
status: public
title: Ham-sandwich theorems applied to intersection problems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1984'
...
---
_id: '4117'
abstract:
- lang: eng
text: "Two or more geometrical objects (solids) are said to be connected whenever
their union is a connected point set in the usual sense. Sets of geometrical objects
are naturally divided into connected components, which are maximal connected subsets.
We show that the connected components of a given collection of n horizontal and
vertical line segments in the plane can be computed in O (n log n) time and O
(n) space and prove that this is essentially optimal. The result is generalized
to compute the connected components of a set of n rectilinearly-oriented rectangles\r\nin
the plane with the same time and space bounds. Several extensions of the results
to higher dimensions and to dynamic sets of objects are discussed."
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: Jan
full_name: Van Leeuwen, Jan
last_name: Van Leeuwen
- first_name: Thomas
full_name: Ottmann, Thomas
last_name: Ottmann
- first_name: Derick
full_name: Wood, Derick
last_name: Wood
citation:
ama: Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. Computing the connected components
of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique
Et Applications-Theoretical Informatics and Applications. 1984;18(2):171-183.
doi:10.1051/ita/1984180201711
apa: Edelsbrunner, H., Van Leeuwen, J., Ottmann, T., & Wood, D. (1984). Computing
the connected components of simple rectilinear geometrical objects in D-Space.
Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications.
EDP Sciences. https://doi.org/10.1051/ita/1984180201711
chicago: Edelsbrunner, Herbert, Jan Van Leeuwen, Thomas Ottmann, and Derick Wood.
“Computing the Connected Components of Simple Rectilinear Geometrical Objects
in D-Space.” Rairo-Informatique Theorique Et Applications-Theoretical Informatics
and Applications. EDP Sciences, 1984. https://doi.org/10.1051/ita/1984180201711.
ieee: H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, and D. Wood, “Computing the connected
components of simple rectilinear geometrical objects in D-Space,” Rairo-Informatique
Theorique Et Applications-Theoretical Informatics and Applications, vol. 18,
no. 2. EDP Sciences, pp. 171–183, 1984.
ista: Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected
components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique
Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.
mla: Edelsbrunner, Herbert, et al. “Computing the Connected Components of Simple
Rectilinear Geometrical Objects in D-Space.” Rairo-Informatique Theorique Et
Applications-Theoretical Informatics and Applications, vol. 18, no. 2, EDP
Sciences, 1984, pp. 171–83, doi:10.1051/ita/1984180201711.
short: H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, D. Wood, Rairo-Informatique
Theorique Et Applications-Theoretical Informatics and Applications 18 (1984) 171–183.
date_created: 2018-12-11T12:07:02Z
date_published: 1984-01-01T00:00:00Z
date_updated: 2022-01-27T15:22:30Z
day: '01'
doi: 10.1051/ita/1984180201711
extern: '1'
intvolume: ' 18'
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 171 - 183
publication: Rairo-Informatique Theorique Et Applications-Theoretical Informatics
and Applications
publication_identifier:
eissn:
- 1290-385X
issn:
- 0397-9326
publication_status: published
publisher: EDP Sciences
publist_id: '2001'
quality_controlled: '1'
status: public
title: Computing the connected components of simple rectilinear geometrical objects
in D-Space
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 18
year: '1984'
...
---
_id: '4118'
abstract:
- lang: eng
text: A rectilinear polygon can be viewed as an art gallery room whose walls meet
at right angles. An algorithm is presented that stations guards in such a room
so that every interior point is visible to some guard. The algorithm partitions
the polygon into L-shaped pieces, a subclass of star-shaped pieces, and locates
one guard within each kernel. The algorithm runs in O(n log n) time in the worst
case for a polygon of n vertices.
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: Joseph
full_name: O'Rourke, Joseph
last_name: O'Rourke
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Edelsbrunner H, O’Rourke J, Welzl E. Stationing guards in rectilinear art galleries.
Computer Vision, Graphics, and Image Processing. 1984;27(2):167-176. doi:10.1016/S0734-189X(84)80041-9
apa: Edelsbrunner, H., O’Rourke, J., & Welzl, E. (1984). Stationing guards in
rectilinear art galleries. Computer Vision, Graphics, and Image Processing.
Elsevier. https://doi.org/10.1016/S0734-189X(84)80041-9
chicago: Edelsbrunner, Herbert, Joseph O’Rourke, and Emo Welzl. “Stationing Guards
in Rectilinear Art Galleries.” Computer Vision, Graphics, and Image Processing.
Elsevier, 1984. https://doi.org/10.1016/S0734-189X(84)80041-9.
ieee: H. Edelsbrunner, J. O’Rourke, and E. Welzl, “Stationing guards in rectilinear
art galleries,” Computer Vision, Graphics, and Image Processing, vol. 27,
no. 2. Elsevier, pp. 167–176, 1984.
ista: Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear
art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.
mla: Edelsbrunner, Herbert, et al. “Stationing Guards in Rectilinear Art Galleries.”
Computer Vision, Graphics, and Image Processing, vol. 27, no. 2, Elsevier,
1984, pp. 167–76, doi:10.1016/S0734-189X(84)80041-9.
short: H. Edelsbrunner, J. O’Rourke, E. Welzl, Computer Vision, Graphics, and Image
Processing 27 (1984) 167–176.
date_created: 2018-12-11T12:07:02Z
date_published: 1984-08-01T00:00:00Z
date_updated: 2022-01-28T08:03:51Z
day: '01'
doi: 10.1016/S0734-189X(84)80041-9
extern: '1'
intvolume: ' 27'
issue: '2'
language:
- iso: eng
month: '08'
oa_version: None
page: 167 - 176
publication: Computer Vision, Graphics, and Image Processing
publication_identifier:
eissn:
- 0734-189X
issn:
- 1557-895X
publication_status: published
publisher: Elsevier
publist_id: '2002'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stationing guards in rectilinear art galleries
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 27
year: '1984'
...
---
_id: '4119'
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: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: 'Edelsbrunner H, Welzl E. Monotone edge sequences in line arrangements and
applications. In: 11th International Symposium on Mathematical Foundations
of Computer Science. Vol 176. MFCS. Springer; 1984:265-272. doi:10.1007/BFb0030307'
apa: 'Edelsbrunner, H., & Welzl, E. (1984). Monotone edge sequences in line
arrangements and applications. In 11th International Symposium on Mathematical
Foundations of Computer Science (Vol. 176, pp. 265–272). Praha, Czechoslovakia:
Springer. https://doi.org/10.1007/BFb0030307'
chicago: Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line
Arrangements and Applications.” In 11th International Symposium on Mathematical
Foundations of Computer Science, 176:265–72. MFCS. Springer, 1984. https://doi.org/10.1007/BFb0030307.
ieee: H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements
and applications,” in 11th International Symposium on Mathematical Foundations
of Computer Science, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272.
ista: 'Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements
and applications. 11th International Symposium on Mathematical Foundations of
Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS,
vol. 176, 265–272.'
mla: Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements
and Applications.” 11th International Symposium on Mathematical Foundations
of Computer Science, vol. 176, Springer, 1984, pp. 265–72, doi:10.1007/BFb0030307.
short: H. Edelsbrunner, E. Welzl, in:, 11th International Symposium on Mathematical
Foundations of Computer Science, Springer, 1984, pp. 265–272.
conference:
end_date: 1984-09-07
location: Praha, Czechoslovakia
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 1984-09-03
date_created: 2018-12-11T12:07:03Z
date_published: 1984-01-01T00:00:00Z
date_updated: 2022-01-28T08:52:23Z
day: '01'
doi: 10.1007/BFb0030307
extern: '1'
intvolume: ' 176'
language:
- iso: eng
month: '01'
oa_version: None
page: 265 - 272
publication: 11th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- 3-540-13372-0
publication_status: published
publisher: Springer
publist_id: '2003'
quality_controlled: '1'
scopus_import: '1'
series_title: MFCS
status: public
title: Monotone edge sequences in line arrangements and applications
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 176
year: '1984'
...
---
_id: '4121'
abstract:
- lang: eng
text: "Whenevern objects are characterized by a matrix of pairwise dissimilarities,
they may be clustered by any of a number of sequential, agglomerative, hierarchical,
nonoverlapping (SAHN) clustering methods. These SAHN clustering methods are defined
by a paradigmatic algorithm that usually requires 0(n 3) time, in the worst case,
to cluster the objects. An improved algorithm (Anderberg 1973), while still requiring
0(n 3) worst-case time, can reasonably be expected to exhibit 0(n 2) expected
behavior. By contrast, we describe a SAHN clustering algorithm that requires 0(n
2 logn) time in the worst case. When SAHN clustering methods exhibit reasonable
space distortion properties, further improvements are possible. We adapt a SAHN
clustering algorithm, based on the efficient construction of nearest neighbor
chains, to obtain a reasonably general SAHN clustering algorithm that requires
in the worst case 0(n 2) time and space.\r\nWhenevern objects are characterized
byk-tuples of real numbers, they may be clustered by any of a family of centroid
SAHN clustering methods. These methods are based on a geometric model in which
clusters are represented by points ink-dimensional real space and points being
agglomerated are replaced by a single (centroid) point. For this model, we have
solved a class of special packing problems involving point-symmetric convex objects
and have exploited it to design an efficient centroid clustering algorithm. Specifically,
we describe a centroid SAHN clustering algorithm that requires 0(n 2) time, in
the worst case, for fixedk and for a family of dissimilarity measures including
the Manhattan, Euclidean, Chebychev and all other Minkowski metrics."
article_processing_charge: No
article_type: original
author:
- first_name: William
full_name: Day, William
last_name: Day
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Day W, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical
clustering methods. Journal of Classification. 1984;1:7-24. doi:10.1007/BF01890115
apa: Day, W., & Edelsbrunner, H. (1984). Efficient algorithms for agglomerative
hierarchical clustering methods. Journal of Classification. Springer. https://doi.org/10.1007/BF01890115
chicago: Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative
Hierarchical Clustering Methods.” Journal of Classification. Springer,
1984. https://doi.org/10.1007/BF01890115.
ieee: W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical
clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24,
1984.
ista: Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical
clustering methods. Journal of Classification. 1, 7–24.
mla: Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative
Hierarchical Clustering Methods.” Journal of Classification, vol. 1, Springer,
1984, pp. 7–24, doi:10.1007/BF01890115.
short: W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.
date_created: 2018-12-11T12:07:04Z
date_published: 1984-01-01T00:00:00Z
date_updated: 2022-01-27T14:16:27Z
day: '01'
doi: 10.1007/BF01890115
extern: '1'
intvolume: ' 1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007%2FBF01890115
month: '01'
oa_version: None
page: 7 - 24
publication: Journal of Classification
publication_identifier:
eissn:
- 1432-1343
issn:
- 0176-4268
publication_status: published
publisher: Springer
publist_id: '1998'
quality_controlled: '1'
status: public
title: Efficient algorithms for agglomerative hierarchical clustering methods
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
year: '1984'
...
---
_id: '4122'
abstract:
- lang: eng
text: Computational geometry, considered a subfield of computer science, is concerned
with the computational aspects of geometric problems. The increasing activity
in this rather young field made it split into several reasonably independent subareas.
This paper presents several key-problems of the classical part of computational
geometry which exhibit strong interrelations. A unified view of the problems is
stressed, and the general ideas behind the methods that solve them are worked
out.
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
citation:
ama: 'Edelsbrunner H. Key-problems and key-methods in computational geometry. In:
1st Symposium of Theoretical Aspects of Computer Science. Vol 166. STACS.
Springer; 1984:1-13. doi:10.1007/3-540-12920-0_1'
apa: 'Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry.
In 1st Symposium of Theoretical Aspects of Computer Science (Vol. 166,
pp. 1–13). Paris, France: Springer. https://doi.org/10.1007/3-540-12920-0_1'
chicago: Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.”
In 1st Symposium of Theoretical Aspects of Computer Science, 166:1–13.
STACS. Springer, 1984. https://doi.org/10.1007/3-540-12920-0_1.
ieee: H. Edelsbrunner, “Key-problems and key-methods in computational geometry,”
in 1st Symposium of Theoretical Aspects of Computer Science, Paris, France,
1984, vol. 166, pp. 1–13.
ista: 'Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry.
1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects
of Computer ScienceSTACS, LNCS, vol. 166, 1–13.'
mla: Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.”
1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer,
1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
short: H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science,
Springer, 1984, pp. 1–13.
conference:
end_date: 1984-04-13
location: Paris, France
name: 'STACS: Theoretical Aspects of Computer Science'
start_date: 1984-04-11
date_created: 2018-12-11T12:07:04Z
date_published: 1984-01-01T00:00:00Z
date_updated: 2022-01-27T14:48:15Z
day: '01'
doi: 10.1007/3-540-12920-0_1
extern: '1'
intvolume: ' 166'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 13
publication: 1st Symposium of Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- 3-540-12920-0
publication_status: published
publisher: Springer
publist_id: '1999'
quality_controlled: '1'
scopus_import: '1'
series_title: STACS
status: public
title: Key-problems and key-methods in computational geometry
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 166
year: '1984'
...
---
_id: '4123'
abstract:
- lang: eng
text: Windowing a two-dimensional picture means to determine those line segments
of the picture that are visible through an axis-parallel window. A study of some
algorithmic problems involved in windowing a picture is offered. Some methods
from computational geometry are exploited to store the picture in a computer such
that (1) those line segments inside or partially inside of a window can be determined
efficiently, and (2) the set of those line segments can be maintained efficiently
while the window is moved parallel to a coordinate axis and/or it is enlarged
or reduced.
acknowledgement: "Research reported in this paper was done while the second author
visited the Technical University of Graz. He was supported by the Netherlands Organization
for the Advancement of Pure Research (ZWO). The first author was supported by the
Austrian Fonds zur Foerderung der wissenschaftlichen Forschung.\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
- first_name: Mark
full_name: Overmars, Mark
last_name: Overmars
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
citation:
ama: Edelsbrunner H, Overmars M, Seidel R. Some methods of computational geometry
applied to computer graphics. Computer Vision, Graphics, and Image Processing.
1984;28(1):92-108. doi:10.1016/0734-189X(84)90142-7
apa: Edelsbrunner, H., Overmars, M., & Seidel, R. (1984). Some methods of computational
geometry applied to computer graphics. Computer Vision, Graphics, and Image
Processing. Elsevier. https://doi.org/10.1016/0734-189X(84)90142-7
chicago: Edelsbrunner, Herbert, Mark Overmars, and Raimund Seidel. “Some Methods
of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics,
and Image Processing. Elsevier, 1984. https://doi.org/10.1016/0734-189X(84)90142-7.
ieee: H. Edelsbrunner, M. Overmars, and R. Seidel, “Some methods of computational
geometry applied to computer graphics,” Computer Vision, Graphics, and Image
Processing, vol. 28, no. 1. Elsevier, pp. 92–108, 1984.
ista: Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational
geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing.
28(1), 92–108.
mla: Edelsbrunner, Herbert, et al. “Some Methods of Computational Geometry Applied
to Computer Graphics.” Computer Vision, Graphics, and Image Processing,
vol. 28, no. 1, Elsevier, 1984, pp. 92–108, doi:10.1016/0734-189X(84)90142-7.
short: H. Edelsbrunner, M. Overmars, R. Seidel, Computer Vision, Graphics, and Image
Processing 28 (1984) 92–108.
date_created: 2018-12-11T12:07:04Z
date_published: 1984-10-01T00:00:00Z
date_updated: 2022-01-27T15:10:04Z
day: '01'
doi: 10.1016/0734-189X(84)90142-7
extern: '1'
intvolume: ' 28'
issue: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 92 - 108
publication: Computer Vision, Graphics, and Image Processing
publication_identifier:
eissn:
- 1557-895X
issn:
- 0734-189X
publication_status: published
publisher: Elsevier
publist_id: '2000'
quality_controlled: '1'
status: public
title: Some methods of computational geometry applied to computer graphics
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 28
year: '1984'
...
---
_id: '4327'
acknowledgement: We thank Professor B. C. Clarke, Dr. K. Janson, Dr. R. Rockwell,
Dr. M. J. van den Berg, and Dr. R. D. Ward for making their work available before
publication. Dr. S. J. Arnold and Dr. L. Partridge provided us with useful references,
and Dr. D. Charlesworth, Dr. J. M. Szymura, and Dr. J. S. Jones critically reviewed
the manuscript.
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: Brian
full_name: Charlesworth, Brian
last_name: Charlesworth
citation:
ama: Barton NH, Charlesworth B. Genetic revolutions, founder effects, and speciation.
Annual Review of Ecology and Systematics. 1984;15:133-164. doi:10.1146/annurev.es.15.110184.001025
apa: Barton, N. H., & Charlesworth, B. (1984). Genetic revolutions, founder
effects, and speciation. Annual Review of Ecology and Systematics. Annual
Reviews. https://doi.org/10.1146/annurev.es.15.110184.001025
chicago: Barton, Nicholas H, and Brian Charlesworth. “Genetic Revolutions, Founder
Effects, and Speciation.” Annual Review of Ecology and Systematics. Annual
Reviews, 1984. https://doi.org/10.1146/annurev.es.15.110184.001025.
ieee: N. H. Barton and B. Charlesworth, “Genetic revolutions, founder effects, and
speciation,” Annual Review of Ecology and Systematics, vol. 15. Annual
Reviews, pp. 133–164, 1984.
ista: Barton NH, Charlesworth B. 1984. Genetic revolutions, founder effects, and
speciation. Annual Review of Ecology and Systematics. 15, 133–164.
mla: Barton, Nicholas H., and Brian Charlesworth. “Genetic Revolutions, Founder
Effects, and Speciation.” Annual Review of Ecology and Systematics, vol.
15, Annual Reviews, 1984, pp. 133–64, doi:10.1146/annurev.es.15.110184.001025.
short: N.H. Barton, B. Charlesworth, Annual Review of Ecology and Systematics 15
(1984) 133–164.
date_created: 2018-12-11T12:08:16Z
date_published: 1984-11-01T00:00:00Z
date_updated: 2022-01-27T13:51:54Z
day: '01'
doi: 10.1146/annurev.es.15.110184.001025
extern: '1'
intvolume: ' 15'
language:
- iso: eng
main_file_link:
- url: https://www.annualreviews.org/doi/10.1146/annurev.es.15.110184.001025
month: '11'
oa_version: None
page: 133 - 164
publication: Annual Review of Ecology and Systematics
publication_identifier:
eissn:
- 1545-2069
issn:
- 0066-4162
publication_status: published
publisher: Annual Reviews
publist_id: '1713'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genetic revolutions, founder effects, and speciation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '1984'
...