---
_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: '4091'
abstract:
- lang: eng
text: An X-ray probe through a polygon measures the length of intersection between
a line and the polygon. This paper considers the properties of various classes
of X-ray probes, and shows how they interact to give finite strategies for completely
describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify
a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes
are necesssary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower
bound on the size of the smallest edge of P is known.
acknowledgement: The research of this author was supported by the Amoco Foundation
Facility for the Development of Computer Science 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. Probing convex polygons with X-Rays. SIAM Journal
on Computing. 1988;17(5):870-882. doi:10.1137/0217054
apa: Edelsbrunner, H., & Skiena, S. (1988). Probing convex polygons with X-Rays.
SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0217054
chicago: Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with
X-Rays.” SIAM Journal on Computing. SIAM, 1988. https://doi.org/10.1137/0217054 .
ieee: H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” SIAM
Journal on Computing, vol. 17, no. 5. SIAM, pp. 870–882, 1988.
ista: Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM
Journal on Computing. 17(5), 870–882.
mla: Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.”
SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
short: H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.
date_created: 2018-12-11T12:06:53Z
date_published: 1988-01-01T00:00:00Z
date_updated: 2022-02-08T11:14:23Z
day: '01'
doi: '10.1137/0217054 '
extern: '1'
intvolume: ' 17'
issue: '5'
language:
- iso: eng
main_file_link:
- url: https://epubs.siam.org/doi/10.1137/0217054
month: '01'
oa_version: None
page: 870 - 882
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2030'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Probing convex polygons with X-Rays
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 17
year: '1988'
...
---
_id: '4317'
article_processing_charge: No
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. Speciation. In: Myers A, Giller P, eds. Analytical Biogeography:
An Integrated Approach to the Study of Animal and Plant Distributions. 1st
ed. Springer; 1988:185-218. doi:10.1007/978-94-009-0435-4'
apa: 'Barton, N. H. (1988). Speciation. In A. Myers & P. Giller (Eds.), Analytical
biogeography: An integrated approach to the study of animal and plant distributions
(1st ed., pp. 185–218). Springer. https://doi.org/10.1007/978-94-009-0435-4'
chicago: 'Barton, Nicholas H. “Speciation.” In Analytical Biogeography: An Integrated
Approach to the Study of Animal and Plant Distributions, edited by Alan Myers
and Paul Giller, 1st ed., 185–218. Springer, 1988. https://doi.org/10.1007/978-94-009-0435-4.'
ieee: 'N. H. Barton, “Speciation,” in Analytical biogeography: An integrated
approach to the study of animal and plant distributions, 1st ed., A. Myers
and P. Giller, Eds. Springer, 1988, pp. 185–218.'
ista: 'Barton NH. 1988.Speciation. In: Analytical biogeography: An integrated approach
to the study of animal and plant distributions. , 185–218.'
mla: 'Barton, Nicholas H. “Speciation.” Analytical Biogeography: An Integrated
Approach to the Study of Animal and Plant Distributions, edited by Alan Myers
and Paul Giller, 1st ed., Springer, 1988, pp. 185–218, doi:10.1007/978-94-009-0435-4.'
short: 'N.H. Barton, in:, A. Myers, P. Giller (Eds.), Analytical Biogeography: An
Integrated Approach to the Study of Animal and Plant Distributions, 1st ed., Springer,
1988, pp. 185–218.'
date_created: 2018-12-11T12:08:13Z
date_published: 1988-01-01T00:00:00Z
date_updated: 2022-02-08T09:19:50Z
day: '01'
doi: 10.1007/978-94-009-0435-4
edition: '1'
editor:
- first_name: Alan
full_name: Myers, Alan
last_name: Myers
- first_name: Paul
full_name: Giller, Paul
last_name: Giller
extern: '1'
keyword:
- biogeography
- biology
- complexity
- distribution
- evolution
- geology
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/book/10.1007/978-94-009-0435-4#toc
month: '01'
oa_version: None
page: 185 - 218
publication: 'Analytical biogeography: An integrated approach to the study of animal
and plant distributions'
publication_identifier:
eissn:
- 978-94-009-0435-4
isbn:
- 978-0-412-40050-6
publication_status: published
publisher: Springer
publist_id: '1736'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Speciation
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1988'
...
---
_id: '4098'
abstract:
- lang: eng
text: To points p and q of a finite set S in d-dimensional Euclidean space Ed are
extreme if {p, q} = S ∩ h, for some open halfspace h. Let e2(d)(n) be the maximum
number of extreme pairs realized by any n points in Ed. We give geometric proofs
of , if n⩾4, and e2(3)(n) = 3n−6, if n⩾6. These results settle the question since
all other cases are trivial.
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: Gerd
full_name: Stöckl, Gerd
last_name: Stöckl
citation:
ama: Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets
in Euclidean spaces. Journal of Combinatorial Theory Series A. 1986;43(2):344-349.
doi:10.1016/0097-3165(86)90075-0
apa: Edelsbrunner, H., & Stöckl, G. (1986). The number of extreme pairs of finite
point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A.
Elsevier. https://doi.org/10.1016/0097-3165(86)90075-0
chicago: Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of
Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series
A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90075-0.
ieee: H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets
in Euclidean spaces,” Journal of Combinatorial Theory Series A, vol. 43,
no. 2. Elsevier, pp. 344–349, 1986.
ista: Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets
in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.
mla: Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite
Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A,
vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:10.1016/0097-3165(86)90075-0.
short: H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986)
344–349.
date_created: 2018-12-11T12:06:56Z
date_published: 1986-11-01T00:00:00Z
date_updated: 2022-02-01T14:02:41Z
day: '01'
doi: 10.1016/0097-3165(86)90075-0
extern: '1'
intvolume: ' 43'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/0097316586900750?via%3Dihub
month: '11'
oa: 1
oa_version: None
page: 344 - 349
publication: Journal of Combinatorial Theory Series A
publication_identifier:
eissn:
- 1096-0899
issn:
- 0097-3165
publication_status: published
publisher: Elsevier
publist_id: '2020'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The number of extreme pairs of finite point-sets in Euclidean spaces
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1986'
...
---
_id: '4103'
abstract:
- lang: eng
text: Let A be an arrangement of n lines in the plane. Suppose F1,…, Fk are faces
in the dissection induced by A and that Fi is a t(Fi)-gon. We give asymptotic
bounds on the maximal sum ∑i=1kt(Fi) which can be realized by k different faces
in an arrangement of n lines. The results improve known bounds for k of higher
order than n(1/2).
acknowledgement: The second author thanks Gan Gusfield for useful discussion.
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 maximal number of edges of many faces in an
arrangement. Journal of Combinatorial Theory Series A. 1986;41(2):159-166.
doi:10.1016/0097-3165(86)90078-6
apa: Edelsbrunner, H., & Welzl, E. (1986). On the maximal number of edges of
many faces in an arrangement. Journal of Combinatorial Theory Series A.
Elsevier. https://doi.org/10.1016/0097-3165(86)90078-6
chicago: Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of
Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A.
Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90078-6.
ieee: H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces
in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41,
no. 2. Elsevier, pp. 159–166, 1986.
ista: Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces
in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.
mla: Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many
Faces in an Arrangement.” Journal of Combinatorial Theory Series A, vol.
41, no. 2, Elsevier, 1986, pp. 159–66, doi:10.1016/0097-3165(86)90078-6.
short: H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986)
159–166.
date_created: 2018-12-11T12:06:57Z
date_published: 1986-11-01T00:00:00Z
date_updated: 2022-02-01T09:46:55Z
day: '01'
doi: 10.1016/0097-3165(86)90078-6
extern: '1'
intvolume: ' 41'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/0097316586900786?via%3Dihub
month: '11'
oa: 1
oa_version: Published Version
page: 159 - 166
publication: Journal of Combinatorial Theory Series A
publication_identifier:
eissn:
- 1096-0899
issn:
- 0097-3165
publication_status: published
publisher: Elsevier
publist_id: '2015'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the maximal number of edges of many faces in an arrangement
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 41
year: '1986'
...
---
_id: '4104'
abstract:
- lang: eng
text: "Point location, often known in graphics as “hit detection,” is one of the
fundamental problems of computational geometry. In a point location query we want
to identify which of a given collection of geometric objects contains a particular
point. Let $\\mathcal{S}$ denote a subdivision of the Euclidean plane into monotone
regions by a straight-line graph of $m$ edges. In this paper we exhibit a substantial
refinement of the technique of Lee and Preparata [SIAM J. Comput., 6 (1977), pp.
594–606] for locating a point in $\\mathcal{S}$ based on separating chains. The
new data structure, called a layered dag, can be built in $O(m)$ time, uses $O(m)$
storage, and makes possible point location in $O(\\log m)$ time. Unlike previous
structures that attain these optimal bounds, the layered dag can be implemented
in a simple and practical way, and is extensible to subdivisions with edges more
general than straight-line segments.\r\n© 1986 Society for Industrial and Applied
Mathematics"
acknowledgement: We would like to thank Andrei Broder, Dan Greene, Mary Claire van
Leunen, Greg Nelson, Lyle Ramshaw, and F. Frances Yao, whose comments and suggestions
have greatly improved the readability of this paper.
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: Jorge
full_name: Stolfi, Jorge
last_name: Stolfi
citation:
ama: Edelsbrunner H, Guibas L, Stolfi J. Optimal point location in a monotone subdivision.
SIAM Journal on Computing. 1986;15(2):317-340. doi:10.1137/0215023
apa: Edelsbrunner, H., Guibas, L., & Stolfi, J. (1986). Optimal point location
in a monotone subdivision. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0215023
chicago: Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point
Location in a Monotone Subdivision.” SIAM Journal on Computing. SIAM, 1986.
https://doi.org/10.1137/0215023.
ieee: H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone
subdivision,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 317–340,
1986.
ista: Edelsbrunner H, Guibas L, Stolfi J. 1986. Optimal point location in a monotone
subdivision. SIAM Journal on Computing. 15(2), 317–340.
mla: Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.”
SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:10.1137/0215023.
short: H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986)
317–340.
date_created: 2018-12-11T12:06:58Z
date_published: 1986-01-01T00:00:00Z
date_updated: 2022-02-01T10:05:55Z
day: '01'
doi: 10.1137/0215023
extern: '1'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 317 - 340
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2016'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal point location in a monotone subdivision
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '1986'
...
---
_id: '4112'
abstract:
- lang: eng
text: 'The batched static version of a searching problem asks for performing a given
set of queries on a given set of objects. All queries are known in advance. The
batched dynamic version of a searching problem is the following: given a sequence
of insertions, deletions, and queries, perform them on an initially empty set.
We will develop methods for solving batched static and batched dynamic versions
of searching problems which are in particular applicable to decomposable searching
problems. The techniques show that batched static (dynamic) versions of searching
problems can often be solved more efficiently than by using known static (dynamic)
data structures. In particular, a technique called “streaming” is described that
reduces the space requirements considerably. The methods have also a number of
applications on set problems. E.g., the k intersecting pairs in a set of n axis-parallel
hyper-rectangles in d dimensions can be reported in O (nlogd−1n + k) time using
only O(n) space.'
acknowledgement: "Research reported in this paper was done while the second author
visited the University of Graz. The first author was supported by the Austrian Fonds
zur Förderung der Wissenschaftlichen Forschung. The second author was supported
by the Netherlands Organization for the Advancement of Pure Research (ZWO). \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
citation:
ama: Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching
problems. Journal of Algorithms. 1985;6(4):515-542. doi:10.1016/0196-6774(85)90030-6
apa: Edelsbrunner, H., & Overmars, M. (1985). Batched dynamic solutions to decomposable
searching problems. Journal of Algorithms. Elsevier. https://doi.org/10.1016/0196-6774(85)90030-6
chicago: Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to
Decomposable Searching Problems.” Journal of Algorithms. Elsevier, 1985.
https://doi.org/10.1016/0196-6774(85)90030-6.
ieee: H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable
searching problems,” Journal of Algorithms, vol. 6, no. 4. Elsevier, pp.
515–542, 1985.
ista: Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable
searching problems. Journal of Algorithms. 6(4), 515–542.
mla: Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable
Searching Problems.” Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985,
pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
short: H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.
date_created: 2018-12-11T12:07:00Z
date_published: 1985-12-01T00:00:00Z
date_updated: 2022-01-31T13:36:56Z
day: '01'
doi: 10.1016/0196-6774(85)90030-6
extern: '1'
intvolume: ' 6'
issue: '4'
language:
- iso: eng
month: '12'
oa_version: None
page: 515 - 542
publication: Journal of Algorithms
publication_identifier:
eissn:
- 1090-2678
issn:
- 0196-6774
publication_status: published
publisher: Elsevier
publist_id: '2010'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Batched dynamic solutions to decomposable searching problems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1985'
...
---
_id: '4120'
abstract:
- lang: eng
text: 'Let P be a set of n points in the Euclidean plane and let C be a convex figure.
We study the problem of preprocessing P so that for any query point q, the points
of P in C+q can be retrieved efficiently. If constant time sumces for deciding
the inclusion of a point in C, we then demonstrate the existence of an optimal
solution: the algorithm requires O(n) space and O(k + log n) time for a query
with output size k. If C is a disk, the problem becomes the wellknown fixed-radius
neighbour problem, to which we thus provide the first known optimal solution.'
acknowledgement: The first author was supported i~1 part by NSF grants MCS 83-03925
and the Office of Naval Research and the Defense Advanced Research Projects Agency
under contract N00014-g3-K-0146 and ARPA Order No. 4786.
article_processing_charge: No
article_type: original
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
citation:
ama: Chazelle B, Edelsbrunner H. Optimal solutions for a class of point retrieval
problems. Journal of Symbolic Computation. 1985;1(1):47-56. doi:10.1016/S0747-7171(85)80028-6
apa: Chazelle, B., & Edelsbrunner, H. (1985). Optimal solutions for a class
of point retrieval problems. Journal of Symbolic Computation. Elsevier.
https://doi.org/10.1016/S0747-7171(85)80028-6
chicago: Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class
of Point Retrieval Problems.” Journal of Symbolic Computation. Elsevier,
1985. https://doi.org/10.1016/S0747-7171(85)80028-6.
ieee: B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval
problems,” Journal of Symbolic Computation, vol. 1, no. 1. Elsevier, pp.
47–56, 1985.
ista: Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval
problems. Journal of Symbolic Computation. 1(1), 47–56.
mla: Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class
of Point Retrieval Problems.” Journal of Symbolic Computation, vol. 1,
no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
short: B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.
date_created: 2018-12-11T12:07:03Z
date_published: 1985-03-01T00:00:00Z
date_updated: 2022-01-31T09:20:18Z
day: '01'
doi: 10.1016/S0747-7171(85)80028-6
extern: '1'
intvolume: ' 1'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0747717185800286?via%3Dihub
month: '03'
oa: 1
oa_version: Published Version
page: 47 - 56
publication: Journal of Symbolic Computation
publication_identifier:
eissn:
- 1095-855X
issn:
- 0747-7171
publication_status: published
publisher: Elsevier
publist_id: '2004'
quality_controlled: '1'
status: public
title: Optimal solutions for a class of point retrieval problems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
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: '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: '4329'
article_processing_charge: No
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. The extended phenotype: the gene as the unit of selection (review
of Dawkins R 1982). Animal Behaviour. 1983;31(2):626-627. doi:10.1016/S0003-3472(83)80100-6'
apa: 'Barton, N. H. (1983). The extended phenotype: the gene as the unit of selection
(review of Dawkins R 1982). Animal Behaviour. Elsevier. https://doi.org/10.1016/S0003-3472(83)80100-6'
chicago: 'Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection
(Review of Dawkins R 1982).” Animal Behaviour. Elsevier, 1983. https://doi.org/10.1016/S0003-3472(83)80100-6.'
ieee: 'N. H. Barton, “The extended phenotype: the gene as the unit of selection
(review of Dawkins R 1982),” Animal Behaviour, vol. 31, no. 2. Elsevier,
pp. 626–627, 1983.'
ista: 'Barton NH. 1983. The extended phenotype: the gene as the unit of selection
(review of Dawkins R 1982). Animal Behaviour. 31(2), 626–627.'
mla: 'Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection
(Review of Dawkins R 1982).” Animal Behaviour, vol. 31, no. 2, Elsevier,
1983, pp. 626–27, doi:10.1016/S0003-3472(83)80100-6.'
short: N.H. Barton, Animal Behaviour 31 (1983) 626–627.
date_created: 2018-12-11T12:08:17Z
date_published: 1983-05-01T00:00:00Z
date_updated: 2022-01-21T12:47:05Z
day: '01'
doi: 10.1016/S0003-3472(83)80100-6
extern: '1'
intvolume: ' 31'
issue: '2'
language:
- iso: eng
month: '05'
oa_version: None
page: 626 - 627
publication: Animal Behaviour
publication_identifier:
eissn:
- 1095-8282
issn:
- 0003-3472
publication_status: published
publisher: Elsevier
publist_id: '1708'
quality_controlled: '1'
status: public
title: 'The extended phenotype: the gene as the unit of selection (review of Dawkins
R 1982)'
type: review
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 31
year: '1983'
...
---
_id: '4332'
article_processing_charge: No
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. Hybrid zones and speciation. In: Atchley W, Woodruff
D, eds. Evolution and Speciation. Cambridge University Press; 1981:109-145.'
apa: Barton, N. H., & Hewitt, G. (1981). Hybrid zones and speciation. In W.
Atchley & D. Woodruff (Eds.), Evolution and Speciation (pp. 109–145).
Cambridge University Press.
chicago: Barton, Nicholas H, and Godfrey Hewitt. “Hybrid Zones and Speciation.”
In Evolution and Speciation, edited by William Atchley and David Woodruff,
109–45. Cambridge University Press, 1981.
ieee: N. H. Barton and G. Hewitt, “Hybrid zones and speciation,” in Evolution
and Speciation, W. Atchley and D. Woodruff, Eds. Cambridge University Press,
1981, pp. 109–145.
ista: 'Barton NH, Hewitt G. 1981.Hybrid zones and speciation. In: Evolution and
Speciation. , 109–145.'
mla: Barton, Nicholas H., and Godfrey Hewitt. “Hybrid Zones and Speciation.” Evolution
and Speciation, edited by William Atchley and David Woodruff, Cambridge University
Press, 1981, pp. 109–45.
short: N.H. Barton, G. Hewitt, in:, W. Atchley, D. Woodruff (Eds.), Evolution and
Speciation, Cambridge University Press, 1981, pp. 109–145.
date_created: 2018-12-11T12:08:18Z
date_published: 1981-05-29T00:00:00Z
date_updated: 2021-12-16T08:24:04Z
day: '29'
editor:
- first_name: William
full_name: Atchley, William
last_name: Atchley
- first_name: David
full_name: Woodruff, David
last_name: Woodruff
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 109 - 145
publication: Evolution and Speciation
publication_identifier:
isbn:
- 9-780-5212-3823-6
publication_status: published
publisher: Cambridge University Press
publist_id: '1702'
quality_controlled: '1'
related_material:
link:
- relation: other
url: https://agris.fao.org/agris-search/search.do?recordID=US201302583227
status: public
title: Hybrid zones and speciation
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '1981'
...