---
_id: '4241'
alternative_title:
- 'Progress in leukocyte biology '
article_processing_charge: No
author:
- first_name: C.
full_name: Curtis, C.
last_name: Curtis
- first_name: J.
full_name: Curtis, J.
last_name: Curtis
- 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: 'Curtis C, Curtis J, Barton NH. Methodology for testing the hypothesis of single
locus control of host resistance to infection and malignancy. In: Skamene E, ed.
Genetic Control of Host Resistance to Infection and Malignancy. Vol 3.
Progress in leukocyte biology. Liss; 1985.'
apa: Curtis, C., Curtis, J., & Barton, N. H. (1985). Methodology for testing
the hypothesis of single locus control of host resistance to infection and malignancy.
In E. Skamene (Ed.), Genetic Control of Host Resistance to Infection and Malignancy
(Vol. 3). Liss.
chicago: Curtis, C., J. Curtis, and Nicholas H Barton. “Methodology for Testing
the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.”
In Genetic Control of Host Resistance to Infection and Malignancy, edited
by Emil Skamene, Vol. 3. Progress in Leukocyte Biology. Liss, 1985.
ieee: C. Curtis, J. Curtis, and N. H. Barton, “Methodology for testing the hypothesis
of single locus control of host resistance to infection and malignancy,” in Genetic
Control of Host Resistance to Infection and Malignancy, vol. 3, E. Skamene,
Ed. Liss, 1985.
ista: 'Curtis C, Curtis J, Barton NH. 1985.Methodology for testing the hypothesis
of single locus control of host resistance to infection and malignancy. In: Genetic
Control of Host Resistance to Infection and Malignancy. Progress in leukocyte
biology , vol. 3.'
mla: Curtis, C., et al. “Methodology for Testing the Hypothesis of Single Locus
Control of Host Resistance to Infection and Malignancy.” Genetic Control of
Host Resistance to Infection and Malignancy, edited by Emil Skamene, vol.
3, Liss, 1985.
short: C. Curtis, J. Curtis, N.H. Barton, in:, E. Skamene (Ed.), Genetic Control
of Host Resistance to Infection and Malignancy, Liss, 1985.
date_created: 2018-12-11T12:07:48Z
date_published: 1985-01-01T00:00:00Z
date_updated: 2022-02-02T09:23:20Z
day: '01'
editor:
- first_name: Emil
full_name: Skamene, Emil
last_name: Skamene
extern: '1'
intvolume: ' 3'
language:
- iso: eng
month: '01'
oa_version: None
publication: Genetic Control of Host Resistance to Infection and Malignancy
publication_identifier:
isbn:
- '9780845141021'
publication_status: published
publisher: Liss
publist_id: '1872'
quality_controlled: '1'
series_title: Progress in leukocyte biology
status: public
title: Methodology for testing the hypothesis of single locus control of host resistance
to infection and malignancy
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3
year: '1985'
...
---
_id: '4325'
article_processing_charge: No
article_type: original
author:
- first_name: Steve
full_name: Jones, Steve
last_name: Jones
- 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: Jones S, Barton NH. Haldane’s Rule OK. Nature. 1985;314:668-668. doi:10.1038/314668a0
apa: Jones, S., & Barton, N. H. (1985). Haldane’s Rule OK. Nature. Nature
Publishing Group. https://doi.org/10.1038/314668a0
chicago: Jones, Steve, and Nicholas H Barton. “Haldane’s Rule OK.” Nature.
Nature Publishing Group, 1985. https://doi.org/10.1038/314668a0.
ieee: S. Jones and N. H. Barton, “Haldane’s Rule OK,” Nature, vol. 314. Nature
Publishing Group, pp. 668–668, 1985.
ista: Jones S, Barton NH. 1985. Haldane’s Rule OK. Nature. 314, 668–668.
mla: Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” Nature, vol.
314, Nature Publishing Group, 1985, pp. 668–668, doi:10.1038/314668a0.
short: S. Jones, N.H. Barton, Nature 314 (1985) 668–668.
date_created: 2018-12-11T12:08:16Z
date_published: 1985-04-25T00:00:00Z
date_updated: 2022-01-28T12:42:09Z
day: '25'
doi: 10.1038/314668a0
extern: '1'
external_id:
pmid:
- '3990801'
intvolume: ' 314'
language:
- iso: eng
month: '04'
oa_version: None
page: 668 - 668
pmid: 1
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '1716'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Haldane's Rule OK
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 314
year: '1985'
...
---
_id: '4326'
acknowledgement: We thank R. Butlin, D. Currie, R. A. Nichols , and S. Rouhani for
their thoughtful comments on the manuscript, and their help in preparing the Figures
and Tables; all those (too numerous to name) who gave us details of their unpublished
work; and T. Tsang and S. Ward for their patient typing. This work was supported
by grants from the NERC and SERC to G. M. Hewitt, and from the SERC and the Nuffield
Foundation to N. H. Barton.
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. Analysis of hybrid zones. Annual Review of Ecology
and Systematics. 1985;16:113-148. doi:10.1146/annurev.es.16.110185.000553
apa: Barton, N. H., & Hewitt, G. (1985). Analysis of hybrid zones. Annual
Review of Ecology and Systematics. Annual Reviews. https://doi.org/10.1146/annurev.es.16.110185.000553
chicago: Barton, Nicholas H, and Godfrey Hewitt. “Analysis of Hybrid Zones.” Annual
Review of Ecology and Systematics. Annual Reviews, 1985. https://doi.org/10.1146/annurev.es.16.110185.000553.
ieee: N. H. Barton and G. Hewitt, “Analysis of hybrid zones,” Annual Review of
Ecology and Systematics, vol. 16. Annual Reviews, pp. 113–148, 1985.
ista: Barton NH, Hewitt G. 1985. Analysis of hybrid zones. Annual Review of Ecology
and Systematics. 16, 113–148.
mla: Barton, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.” Annual
Review of Ecology and Systematics, vol. 16, Annual Reviews, 1985, pp. 113–48,
doi:10.1146/annurev.es.16.110185.000553.
short: N.H. Barton, G. Hewitt, Annual Review of Ecology and Systematics 16 (1985)
113–148.
date_created: 2018-12-11T12:08:16Z
date_published: 1985-11-01T00:00:00Z
date_updated: 2022-01-28T12:32:23Z
day: '01'
doi: 10.1146/annurev.es.16.110185.000553
extern: '1'
intvolume: ' 16'
language:
- iso: eng
month: '11'
oa_version: None
page: 113 - 148
publication: Annual Review of Ecology and Systematics
publication_identifier:
eissn:
- 1545-2069
issn:
- 0066-4162
publication_status: published
publisher: Annual Reviews
publist_id: '1714'
quality_controlled: '1'
status: public
title: Analysis of hybrid zones
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 16
year: '1985'
...
---
_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'
...
---
_id: '3562'
abstract:
- lang: eng
text: "The segment tree is a data structure for storing and maintaining a set of
intervals on the real line. It has been used for an efficient algorithmic approach
in a variety of geometric problems including the problem of deter-mining intersections
among axis-parallel rectangles, computing the measure of a set of axis-parallel
rectangles, and locating a point in a planar subdivision. A segment tree for n
intervals requires 0(n) space in the best case and 0(n log n) space in the worst
case. It is shown that segment trees require 0(n log n) space even in the expected
case. Additionally, the worst-case upper bound on the space requirement of segment
trees is improved over the previously known bound. Surprisingly, the space requirements
in the expected and in the worst case differ only little. \r\n"
alternative_title:
- 'Advances in Computing Research '
article_processing_charge: No
author:
- first_name: W.
full_name: Bucher, W.
last_name: Bucher
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Bucher W, Edelsbrunner H. On expected- and worst-case segment trees. In: Preparata
F, ed. Computational Geometry: Theory and Applications. Vol 1. Elsevier;
1983:109-125.'
apa: 'Bucher, W., & Edelsbrunner, H. (1983). On expected- and worst-case segment
trees. In F. Preparata (Ed.), Computational Geometry: Theory and Applications
(Vol. 1, pp. 109–125). Elsevier.'
chicago: 'Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment
Trees.” In Computational Geometry: Theory and Applications, edited by Franco
Preparata, 1:109–25. Elsevier, 1983.'
ieee: 'W. Bucher and H. Edelsbrunner, “On expected- and worst-case segment trees,”
in Computational Geometry: Theory and Applications, vol. 1, F. Preparata,
Ed. Elsevier, 1983, pp. 109–125.'
ista: 'Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees.
In: Computational Geometry: Theory and Applications. Advances in Computing Research
, vol. 1, 109–125.'
mla: 'Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment
Trees.” Computational Geometry: Theory and Applications, edited by Franco
Preparata, vol. 1, Elsevier, 1983, pp. 109–25.'
short: 'W. Bucher, H. Edelsbrunner, in:, F. Preparata (Ed.), Computational Geometry:
Theory and Applications, Elsevier, 1983, pp. 109–125.'
date_created: 2018-12-11T12:03:58Z
date_published: 1983-01-01T00:00:00Z
date_updated: 2022-01-27T07:40:13Z
day: '01'
editor:
- first_name: Franco
full_name: Preparata, Franco
last_name: Preparata
extern: '1'
intvolume: ' 1'
language:
- iso: eng
main_file_link:
- url: http://pub.ist.ac.at/~edels/Papers/1983-B-01-ExpectedSegmentTrees.pdf
month: '01'
oa_version: None
page: 109 - 125
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '2823'
quality_controlled: '1'
status: public
title: On expected- and worst-case segment trees
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
year: '1983'
...
---
_id: '3563'
abstract:
- lang: eng
text: "Usually in computer graphics, a two-dimensional view of a set of three-dimensional
objects is considered. In this article we reduce the dimensionality by one in
each case. In other words we study what, for obvious reasons, we call Flatland
graphics. This forms the beginning of a mathematical investigation of computer
graphics and, at the same time, provides uniform solutions for a number of computational
geometry problems. In particular we study the maintenance of a view during insertion
and deletion of objects and the \"frame-to-frame\" coherence while walking around
a set of objects. Both parallel and perspective projections are considered. Our
major concern is convex objects that are simple—in a sense, made precise in this
article. However, we will close this article by discussing some possible extensions
to nonconvex objects and/or to higher dimensions. The investigation also serves
to demonstrate a number of tools that have been developed recently in the context
of computational geometry. For example. dynamization and searching. \r\n\r\n"
alternative_title:
- ' Advances in Computing Research'
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: Mark
full_name: Overmars, Mark
last_name: Overmars
- first_name: Derick
full_name: Wood, Derick
last_name: Wood
citation:
ama: 'Edelsbrunner H, Overmars M, Wood D. Graphics in Flatland: a case study. In:
Preparata F, ed. Computational Geometry: Theory and Applications. Vol 1.
Elsevier; 1983:35-59.'
apa: 'Edelsbrunner, H., Overmars, M., & Wood, D. (1983). Graphics in Flatland:
a case study. In F. Preparata (Ed.), Computational Geometry: Theory and Applications
(Vol. 1, pp. 35–59). Elsevier.'
chicago: 'Edelsbrunner, Herbert, Mark Overmars, and Derick Wood. “Graphics in Flatland:
A Case Study.” In Computational Geometry: Theory and Applications, edited
by Franco Preparata, 1:35–59. Elsevier, 1983.'
ieee: 'H. Edelsbrunner, M. Overmars, and D. Wood, “Graphics in Flatland: a case
study,” in Computational Geometry: Theory and Applications, vol. 1, F.
Preparata, Ed. Elsevier, 1983, pp. 35–59.'
ista: 'Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study.
In: Computational Geometry: Theory and Applications. Advances in Computing Research,
vol. 1, 35–59.'
mla: 'Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” Computational
Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier,
1983, pp. 35–59.'
short: 'H. Edelsbrunner, M. Overmars, D. Wood, in:, F. Preparata (Ed.), Computational
Geometry: Theory and Applications, Elsevier, 1983, pp. 35–59.'
date_created: 2018-12-11T12:03:59Z
date_published: 1983-01-01T00:00:00Z
date_updated: 2022-01-25T15:49:17Z
day: '01'
editor:
- first_name: Franco
full_name: Preparata, Franco
last_name: Preparata
extern: '1'
intvolume: ' 1'
language:
- iso: eng
month: '01'
oa_version: None
page: 35 - 59
publication: 'Computational Geometry: Theory and Applications'
publication_identifier:
isbn:
- 0-89232-356-6
publication_status: published
publisher: Elsevier
publist_id: '2822'
quality_controlled: '1'
status: public
title: 'Graphics in Flatland: a case study'
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
year: '1983'
...
---
_id: '3564'
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. Neue Entwicklungen im Bereich Datenstrukturen. In: Maurer
H, ed. Überblicke Informationsverarbeitung . BI Wissenschaftsverlag; 1983:55-109.'
apa: Edelsbrunner, H. (1983). Neue Entwicklungen im Bereich Datenstrukturen. In
H. Maurer (Ed.), Überblicke Informationsverarbeitung (pp. 55–109). BI
Wissenschaftsverlag.
chicago: Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.”
In Überblicke Informationsverarbeitung , edited by Hermann Maurer, 55–109.
BI Wissenschaftsverlag, 1983.
ieee: H. Edelsbrunner, “Neue Entwicklungen im Bereich Datenstrukturen,” in Überblicke
Informationsverarbeitung , H. Maurer, Ed. BI Wissenschaftsverlag, 1983, pp.
55–109.
ista: 'Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke
Informationsverarbeitung . , 55–109.'
mla: Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” Überblicke
Informationsverarbeitung , edited by Hermann Maurer, BI Wissenschaftsverlag,
1983, pp. 55–109.
short: H. Edelsbrunner, in:, H. Maurer (Ed.), Überblicke Informationsverarbeitung
, BI Wissenschaftsverlag, 1983, pp. 55–109.
date_created: 2018-12-11T12:03:59Z
date_published: 1983-01-01T00:00:00Z
date_updated: 2022-01-25T15:28:05Z
day: '01'
editor:
- first_name: Hermann
full_name: Maurer, Hermann
last_name: Maurer
extern: '1'
language:
- iso: ger
month: '01'
oa_version: None
page: 55 - 109
publication: 'Überblicke Informationsverarbeitung '
publication_identifier:
isbn:
- '9783411016587'
publication_status: published
publisher: BI Wissenschaftsverlag
publist_id: '2821'
quality_controlled: '1'
status: public
title: Neue Entwicklungen im Bereich Datenstrukturen
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1983'
...
---
_id: '3598'
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: Steve
full_name: Jones, Steve
last_name: Jones
citation:
ama: 'Barton NH, Jones S. Mitochondrial DNA: new clues about evolution. Nature.
1983;306:317-318. doi:10.1038/306317a0'
apa: 'Barton, N. H., & Jones, S. (1983). Mitochondrial DNA: new clues about
evolution. Nature. Springer Nature. https://doi.org/10.1038/306317a0'
chicago: 'Barton, Nicholas H, and Steve Jones. “Mitochondrial DNA: New Clues about
Evolution.” Nature. Springer Nature, 1983. https://doi.org/10.1038/306317a0.'
ieee: 'N. H. Barton and S. Jones, “Mitochondrial DNA: new clues about evolution,”
Nature, vol. 306. Springer Nature, pp. 317–318, 1983.'
ista: 'Barton NH, Jones S. 1983. Mitochondrial DNA: new clues about evolution. Nature.
306, 317–318.'
mla: 'Barton, Nicholas H., and Steve Jones. “Mitochondrial DNA: New Clues about
Evolution.” Nature, vol. 306, Springer Nature, 1983, pp. 317–18, doi:10.1038/306317a0.'
short: N.H. Barton, S. Jones, Nature 306 (1983) 317–318.
date_created: 2018-12-11T12:04:10Z
date_published: 1983-11-24T00:00:00Z
date_updated: 2022-01-25T15:17:15Z
day: '24'
doi: 10.1038/306317a0
extern: '1'
external_id:
pmid:
- '6646215'
intvolume: ' 306'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/306317a0
month: '11'
oa_version: None
page: 317 - 318
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
publist_id: '2785'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mitochondrial DNA: new clues about evolution'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 306
year: '1983'
...
---
_id: '3666'
abstract:
- lang: eng
text: We have made an extensive allozyme survey of 21 enzyme and protein loci in
populations of the alpine grasshopper Podisma pedestris. This species occurs in
two races, differing by a chromosomal fusion which separates the ancestral XO/XX
race from a derived neo-XY race. These races also differ in DNA content, and hybrids
between them have reduced viability. Electrophoresis reveals that the amount of
genetic differentiation between these races is no greater than the variation among
populations within each race. Both larger-scale surveys and a detailed survey
of an area where the races hybridize, show that the chromosomal change is not
correlated with gene frequency changes at any of the 21 loci studied. These findings
are consistent with recently developed theory concerning the strength of the barrier
to gene flow posed by a hybrid zone with characteristics such as those measured
experimentally in Podisma. It is argued that hybrid zones in other species which
involve allozymic differences do so because of stronger selection against hybrids
rather than through mating isolation.
article_processing_charge: No
article_type: original
author:
- first_name: Bruce
full_name: Halliday, Bruce
last_name: Halliday
- 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: Halliday B, Barton NH, Hewitt G. Electrophoretic analysis of a chromosomal
hybrid zone in the grasshopper Podisma pedestris. Biological Journal of the
Linnean Society. 1983;19(1):51-62. doi:10.1111/j.1095-8312.1983.tb00776.x
apa: Halliday, B., Barton, N. H., & Hewitt, G. (1983). Electrophoretic analysis
of a chromosomal hybrid zone in the grasshopper Podisma pedestris. Biological
Journal of the Linnean Society. Oxford University Press. https://doi.org/10.1111/j.1095-8312.1983.tb00776.x
chicago: Halliday, Bruce, Nicholas H Barton, and Godfrey Hewitt. “Electrophoretic
Analysis of a Chromosomal Hybrid Zone in the Grasshopper Podisma Pedestris.” Biological
Journal of the Linnean Society. Oxford University Press, 1983. https://doi.org/10.1111/j.1095-8312.1983.tb00776.x.
ieee: B. Halliday, N. H. Barton, and G. Hewitt, “Electrophoretic analysis of a chromosomal
hybrid zone in the grasshopper Podisma pedestris,” Biological Journal of the
Linnean Society, vol. 19, no. 1. Oxford University Press, pp. 51–62, 1983.
ista: Halliday B, Barton NH, Hewitt G. 1983. Electrophoretic analysis of a chromosomal
hybrid zone in the grasshopper Podisma pedestris. Biological Journal of the Linnean
Society. 19(1), 51–62.
mla: Halliday, Bruce, et al. “Electrophoretic Analysis of a Chromosomal Hybrid Zone
in the Grasshopper Podisma Pedestris.” Biological Journal of the Linnean Society,
vol. 19, no. 1, Oxford University Press, 1983, pp. 51–62, doi:10.1111/j.1095-8312.1983.tb00776.x.
short: B. Halliday, N.H. Barton, G. Hewitt, Biological Journal of the Linnean Society
19 (1983) 51–62.
date_created: 2018-12-11T12:04:31Z
date_published: 1983-02-01T00:00:00Z
date_updated: 2022-01-25T14:52:15Z
day: '01'
doi: 10.1111/j.1095-8312.1983.tb00776.x
extern: '1'
intvolume: ' 19'
issue: '1'
keyword:
- Hybrid zone
- Electrophoresis
- Podisma pedestris
- Polymorphism
language:
- iso: eng
main_file_link:
- url: https://academic.oup.com/biolinnean/article-abstract/19/1/51/2666256?redirectedFrom=fulltext
month: '02'
oa_version: None
page: 51 - 62
publication: Biological Journal of the Linnean Society
publication_identifier:
eissn:
- 1095-8312
issn:
- 0024-4066
publication_status: published
publisher: Oxford University Press
publist_id: '2717'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma
pedestris
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '1983'
...
---
_id: '3667'
abstract:
- lang: eng
text: Populations of the grasshopper Podisma pedestris were collected from two ends
of a zone of hybridization between two chromosome races, at Seyne and Tende in
southern France. 21 enzyme and protein loci were detected by gel electrophoresis.
Six of these loci showed widespread polymorphism, and a further eleven had very
little or no variation. Two loci (Idh, 6Pgd) had rare alleles in different frequencies
in the two areas surveyed. The remaining two loci (Mdh-1, Mdh-2) showed a marked
increase in the frequency of rare variants, from 1 per cent outside the hybrid
zone, up to 5 per cent at its centre. This region of increased electrophoretic
variation coincided with the chromosomal cline between the two races, and with
a region of decreased viability. It was spread over about the same width as the
chromosomal cline. Possible explanations for this extra variation include intragenic
recombination and elevated mutation rates.
acknowledgement: We would like to thank Manse East, Lynda Flegg, and Sim Webb for
their excellent technical assistance, and Prof. J. M. Thoday for helpful comments.
Financial support was provided by a NERC Studentship to NHB, and a SRC grant to
GMH.
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: Bruce
full_name: Halliday, Bruce
last_name: Halliday
- first_name: Godfrey
full_name: Hewitt, Godfrey
last_name: Hewitt
citation:
ama: Barton NH, Halliday B, Hewitt G. Rare electrophoretic variants in a hybrid
zone. Heredity. 1983;50(2):139-146. doi:10.1038/hdy.1983.15
apa: Barton, N. H., Halliday, B., & Hewitt, G. (1983). Rare electrophoretic
variants in a hybrid zone. Heredity. Nature Publishing Group. https://doi.org/10.1038/hdy.1983.15
chicago: Barton, Nicholas H, Bruce Halliday, and Godfrey Hewitt. “Rare Electrophoretic
Variants in a Hybrid Zone.” Heredity. Nature Publishing Group, 1983. https://doi.org/10.1038/hdy.1983.15.
ieee: N. H. Barton, B. Halliday, and G. Hewitt, “Rare electrophoretic variants in
a hybrid zone,” Heredity, vol. 50, no. 2. Nature Publishing Group, pp.
139–146, 1983.
ista: Barton NH, Halliday B, Hewitt G. 1983. Rare electrophoretic variants in a
hybrid zone. Heredity. 50(2), 139–146.
mla: Barton, Nicholas H., et al. “Rare Electrophoretic Variants in a Hybrid Zone.”
Heredity, vol. 50, no. 2, Nature Publishing Group, 1983, pp. 139–46, doi:10.1038/hdy.1983.15.
short: N.H. Barton, B. Halliday, G. Hewitt, Heredity 50 (1983) 139–146.
date_created: 2018-12-11T12:04:31Z
date_published: 1983-04-01T00:00:00Z
date_updated: 2022-01-25T14:07:12Z
day: '01'
doi: 10.1038/hdy.1983.15
extern: '1'
intvolume: ' 50'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.nature.com/articles/hdy198315
month: '04'
oa: 1
oa_version: Published Version
page: 139 - 146
publication: Heredity
publication_identifier:
eissn:
- 1365-2540
issn:
- 0018-067X
publication_status: published
publisher: Nature Publishing Group
publist_id: '2716'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rare electrophoretic variants in a hybrid zone
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 50
year: '1983'
...
---
_id: '3668'
abstract:
- lang: eng
text: When two populations which differ at many loci meet, the degree of introgression
of alleles across the boundary will depend on the selection acting on each locus
(s), the rate of recombination between adjacent loci (r), and the number of loci
involved (n). Simple scaling arguments suggest that the behavior of the system
should depend on the ratio of selection to recombination (θ = s/r), and on n.
This is borne out by mathematical analysis of two demes which exchange individuals
at a low rate; when selection is stronger than recombination (θ > 1), the effective
selection on each locus is comparable to the total selection over the whole genome
(s* ∼ ns). When selection is weaker than recombination (θ < 1), the effective
selection is much weaker, but is still stronger than the selection on each locus
alone (s* \sim sn20 for small θ). When n is very large, these two regimes are
separated by a sharp threshold at θ = 1. The results are extended to two taxa
which meet in a continuous habitat; the effective selection pressure, which determines
the width of the hybrid zone, behaves in the same way as for the simpler case
above. Even when selection is weak compared to recombination, multilocus clines
have a sharp step at their center, flanked by tails of introgression in which
the alleles behave independently of each other. The set of clines acts as a barrier
to gene flow, and it is shown that the barrier is strongest when selection is
spread over many loci. The implications of the results for divergence and speciation
are discussed.
acknowledgement: "I would like to thank G. Hewitt, J. Raper, M. Shaw, P. Oliver, M.
Slatkin, J. Felsenstein, and D. J. Futuyma for their\r\n helpful comments. This
work was partly supported by an SRC Post-Doctoral Fellowship."
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. Multilocus clines. Evolution; International Journal of Organic
Evolution. 1983;37(3):454-471. doi:10.2307/2408260
apa: Barton, N. H. (1983). Multilocus clines. Evolution; International Journal
of Organic Evolution. Society for the Study of Evolution. https://doi.org/10.2307/2408260
chicago: Barton, Nicholas H. “Multilocus Clines.” Evolution; International Journal
of Organic Evolution. Society for the Study of Evolution, 1983. https://doi.org/10.2307/2408260.
ieee: N. H. Barton, “Multilocus clines,” Evolution; International Journal of
Organic Evolution, vol. 37, no. 3. Society for the Study of Evolution, pp.
454–471, 1983.
ista: Barton NH. 1983. Multilocus clines. Evolution; International Journal of Organic
Evolution. 37(3), 454–471.
mla: Barton, Nicholas H. “Multilocus Clines.” Evolution; International Journal
of Organic Evolution, vol. 37, no. 3, Society for the Study of Evolution,
1983, pp. 454–71, doi:10.2307/2408260.
short: N.H. Barton, Evolution; International Journal of Organic Evolution 37 (1983)
454–471.
date_created: 2018-12-11T12:04:31Z
date_published: 1983-05-01T00:00:00Z
date_updated: 2022-08-19T07:08:29Z
day: '01'
doi: 10.2307/2408260
extern: '1'
external_id:
pmid:
- '28563316 '
intvolume: ' 37'
issue: '3'
language:
- iso: eng
main_file_link:
- url: http://www.jstor.org/stable/2408260
month: '05'
oa_version: None
page: 454 - 471
pmid: 1
publication: Evolution; International Journal of Organic Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Society for the Study of Evolution
publist_id: '2715'
quality_controlled: '1'
status: public
title: Multilocus clines
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '1983'
...
---
_id: '4124'
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. On the number of equal-sized semispaces of a set
of points in the plane. In: International Colloquium on Automata, Languages,
and Programming. Vol 154. LNCS. Springer; 1983:182-187. doi:10.1007/BFb0036908'
apa: 'Edelsbrunner, H., & Welzl, E. (1983). On the number of equal-sized semispaces
of a set of points in the plane. In International Colloquium on Automata, Languages,
and Programming (Vol. 154, pp. 182–187). Barcelona, Spain: Springer. https://doi.org/10.1007/BFb0036908'
chicago: Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces
of a Set of Points in the Plane.” In International Colloquium on Automata,
Languages, and Programming, 154:182–87. LNCS. Springer, 1983. https://doi.org/10.1007/BFb0036908.
ieee: H. Edelsbrunner and E. Welzl, “On the number of equal-sized semispaces of
a set of points in the plane,” in International Colloquium on Automata, Languages,
and Programming, Barcelona, Spain, 1983, vol. 154, pp. 182–187.
ista: 'Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of
a set of points in the plane. International Colloquium on Automata, Languages,
and Programming. ICALP: Automata, Languages and ProgrammingLNCS, LNCS, vol. 154,
182–187.'
mla: Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces
of a Set of Points in the Plane.” International Colloquium on Automata, Languages,
and Programming, vol. 154, Springer, 1983, pp. 182–87, doi:10.1007/BFb0036908.
short: H. Edelsbrunner, E. Welzl, in:, International Colloquium on Automata, Languages,
and Programming, Springer, 1983, pp. 182–187.
conference:
end_date: 1983-07-22
location: Barcelona, Spain
name: 'ICALP: Automata, Languages and Programming'
start_date: 1983-07-18
date_created: 2018-12-11T12:07:04Z
date_published: 1983-01-01T00:00:00Z
date_updated: 2022-01-25T13:42:40Z
day: '01'
doi: 10.1007/BFb0036908
extern: '1'
intvolume: ' 154'
keyword:
- Voronoi diagram
- Asymptotic bound
- Straightforward counting
- Affine trans
- Neighbor Voronoi diagram
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007%2FBFb0036908
month: '01'
oa_version: None
page: 182 - 187
publication: International Colloquium on Automata, Languages, and Programming
publication_status: published
publisher: Springer
publist_id: '1996'
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: On the number of equal-sized semispaces of a set of points in the plane
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 154
year: '1983'
...
---
_id: '4125'
abstract:
- lang: eng
text: "Let S denote a set of n points in the plane such that each point p has assigned
a positive weight w(p) which expresses its capability to influence its neighbourhood.
In this sense, the weighted distance of an arbitrary point x from p is given by
de(x,p)/w(p) where de denotes the Euclidean distance function. The weighted Voronoi
diagram for S is a subdivision of the plane such that each point p in S is associated
with a region consisting of all points x in the plane for which p is a weighted
nearest point of S.\r\n\r\nAn algorithm which constructs the weighted Voronoi
diagram for S in O(n2) time is outlined in this paper. The method is optimal as
the diagram can consist of Θ(n2) faces, edges and vertices.\r\n"
acknowledgement: The second author gratefully acknowledges discussions on the presented
topic with David Kirkpatrick and Raimund Seidel.
article_processing_charge: No
article_type: original
author:
- first_name: Franz
full_name: Aurenhammer, Franz
last_name: Aurenhammer
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Aurenhammer F, Edelsbrunner H. An optimal algorithm for constructing the weighted
Voronoi diagram in the plane. Pattern Recognition. 1983;17(2):251-257.
doi:10.1016/0031-3203(84)90064-5
apa: Aurenhammer, F., & Edelsbrunner, H. (1983). An optimal algorithm for constructing
the weighted Voronoi diagram in the plane. Pattern Recognition. Elsevier.
https://doi.org/10.1016/0031-3203(84)90064-5
chicago: Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for
Constructing the Weighted Voronoi Diagram in the Plane.” Pattern Recognition.
Elsevier, 1983. https://doi.org/10.1016/0031-3203(84)90064-5.
ieee: F. Aurenhammer and H. Edelsbrunner, “An optimal algorithm for constructing
the weighted Voronoi diagram in the plane,” Pattern Recognition, vol. 17,
no. 2. Elsevier, pp. 251–257, 1983.
ista: Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing
the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.
mla: Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing
the Weighted Voronoi Diagram in the Plane.” Pattern Recognition, vol. 17,
no. 2, Elsevier, 1983, pp. 251–57, doi:10.1016/0031-3203(84)90064-5.
short: F. Aurenhammer, H. Edelsbrunner, Pattern Recognition 17 (1983) 251–257.
date_created: 2018-12-11T12:07:05Z
date_published: 1983-07-01T00:00:00Z
date_updated: 2022-01-27T14:06:27Z
day: '01'
doi: 10.1016/0031-3203(84)90064-5
extern: '1'
intvolume: ' 17'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/0031320384900645?via%3Dihub
month: '07'
oa_version: None
page: 251 - 257
publication: Pattern Recognition
publication_identifier:
eissn:
- 1873-5142
issn:
- 0031-3203
publication_status: published
publisher: Elsevier
publist_id: '1997'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An optimal algorithm for constructing the weighted Voronoi diagram in the plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 17
year: '1983'
...