[{"quality_controlled":"1","status":"public","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0306452289901097?via%3Dihub"}],"abstract":[{"text":"Distribution of putative glutamatergic neurons in the lower brainstem and cerebellum of the rat was examined immunocytochemically by using a monoclonal antibody against phosphate-activated glutaminase, which has been proposed to be a major synthetic enzyme of transmitter glutamate and so may serve as a marker for glutamatergic neurons in the central nervous system. Intensely-immunolabeled neuronal cell bodies were densely distributed in the main precerebellar nuclei sending mossy fibers to the cerebellum; in the pontine nuclei, pontine tegmental reticular nucleus of Bechterew, external cuneate nucleus, and lateral reticular nucleus of the medulla oblongata. Phosphate-activated glutaminase-immunoreactive granular deposits were densely seen in the brachium pontis and restiform body, suggesting the immunolabeling of mossy fibers of passage. In the cerebellum, neuropil within the granule cell layer of the cerebellar cortex displayed intense phosphate-activated glutaminase-immunoreactivity, and that within the deep cerebellar nuclei showed moderate immunoreactivity. These results indicate that many mossy fiber terminals originate from phosphate-activated glutaminase-containing neurons and utilize phosphate-activated glutaminase for the synthesis of transmitter glutamate. Intensely-immunostained neuronal cell bodies were further observed in other regions which have been reported to contain neurons sending mossy fibers to the cerebellum; in the dorsal part of the principal sensory trigeminal nucleus, dorsomedial part of the oral subnucleus of the spinal trigeminal nucleus, interpolar subnucleus of the spinal trigeminal nucleus, paratrigeminal nucleus, supragenual nucleus, regions dorsal to the abducens nucleus and genu of the facial nerve, superior and medial vestibular nuclei, cell groups f, x and y, hypoglossal prepositus nucleus, intercalated nucleus, nucleus of Roller, reticular regions intercalated between the motor trigeminal and principal sensory trigeminal nuclei, linear nucleus, and gigantocellular and paramedian reticular formation. Neuronal cell bodies with intense phosphate-activated glutaminase-immunoreactivity were also found in other brainstem regions, such as the paracochlear glial substance, posterior ventral cochlear nucleus, and cell group e. Although it is still controversial whether all glutamatergic neurons use phosphate-activated glutaminase in a transmitter-related process and whether phosphate-activated glutaminase is involved in other metabolism-related processes, the neurons showing intense phosphate-activated glutaminase-immuno-reactivity in the present study were suggested to be putative glutamatergic neurons.","lang":"eng"}],"date_created":"2018-12-11T11:57:54Z","type":"journal_article","month":"01","title":"Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat","year":"1989","doi":"10.1016/0306-4522(89)90109-7","author":[{"last_name":"Kaneko","first_name":"Takeshi","full_name":"Kaneko, Takeshi"},{"full_name":"Itoh, Kazuo","last_name":"Itoh","first_name":"Kazuo"},{"orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mizuno, Noboru","first_name":"Noboru","last_name":"Mizuno"}],"scopus_import":"1","page":"79 - 98","day":"01","article_type":"original","publisher":"Elsevier","publication_status":"published","oa_version":"None","volume":32,"date_published":"1989-01-01T00:00:00Z","publication":"Neuroscience","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"        32","acknowledgement":"The authors wish to thank Mr. Akira Uesugi and Mr. Ken’ichi Uesugi for their photographic help. This work was partly supported by grants-in-aid from the Ministry of Education, science and Culture of Japan for Special Project Research 63112003. Special Research Project on Priority-Areas 63623505, Special Research 62480098 and Encouragement of Young Scientist 63770043. The support of the Niwa Medical Research Foundation, Dr. Satoru Fukuchi, Dr. Toshio Fukuda, Dr. Ritsu Hayashi, Dr. Yutaka Kitani, Dr. Hiroshi Matsushima, Dr. Gonpei Niwa, Dr. Hiroyasu Ohtsuka, Dr. Shigeo Tamaki, and Dr. Eizo Watanabe are gratefully acknowledged. ","issue":"1","article_processing_charge":"No","date_updated":"2022-02-15T09:47:08Z","_id":"2479","external_id":{"pmid":["2586753"]},"pmid":1,"citation":{"mla":"Kaneko, Takeshi, et al. “Glutaminase-like Immunoreactivity in the Lower Brainstem and Cerebellum of the Adult Rat.” <i>Neuroscience</i>, vol. 32, no. 1, Elsevier, 1989, pp. 79–98, doi:<a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">10.1016/0306-4522(89)90109-7</a>.","ama":"Kaneko T, Itoh K, Shigemoto R, Mizuno N. Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. <i>Neuroscience</i>. 1989;32(1):79-98. doi:<a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">10.1016/0306-4522(89)90109-7</a>","ista":"Kaneko T, Itoh K, Shigemoto R, Mizuno N. 1989. Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. Neuroscience. 32(1), 79–98.","short":"T. Kaneko, K. Itoh, R. Shigemoto, N. Mizuno, Neuroscience 32 (1989) 79–98.","apa":"Kaneko, T., Itoh, K., Shigemoto, R., &#38; Mizuno, N. (1989). Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">https://doi.org/10.1016/0306-4522(89)90109-7</a>","chicago":"Kaneko, Takeshi, Kazuo Itoh, Ryuichi Shigemoto, and Noboru Mizuno. “Glutaminase-like Immunoreactivity in the Lower Brainstem and Cerebellum of the Adult Rat.” <i>Neuroscience</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">https://doi.org/10.1016/0306-4522(89)90109-7</a>.","ieee":"T. Kaneko, K. Itoh, R. Shigemoto, and N. Mizuno, “Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat,” <i>Neuroscience</i>, vol. 32, no. 1. Elsevier, pp. 79–98, 1989."},"publication_identifier":{"issn":["0306-4522"],"eissn":["1873-7544"]},"language":[{"iso":"eng"}],"publist_id":"4422","extern":"1"},{"pmid":1,"publication_identifier":{"eissn":["1083-351X"],"issn":["0021-9258"]},"citation":{"apa":"Yokota, Y., Sasai, Y., Tanaka, K., Fujiwara, T., Tsuchida, K., Shigemoto, R., … Nakanishi, S. (1989). Molecular characterization of a functional cDNA for rat substance P receptor. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1016/S0021-9258(19)84619-7\">https://doi.org/10.1016/S0021-9258(19)84619-7</a>","short":"Y. Yokota, Y. Sasai, K. Tanaka, T. Fujiwara, K. Tsuchida, R. Shigemoto, A. Kakizuka, H. Ohkubo, S. Nakanishi, Journal of Biological Chemistry 264 (1989) 17649–17652.","ista":"Yokota Y, Sasai Y, Tanaka K, Fujiwara T, Tsuchida K, Shigemoto R, Kakizuka A, Ohkubo H, Nakanishi S. 1989. Molecular characterization of a functional cDNA for rat substance P receptor. Journal of Biological Chemistry. 264(30), 17649–17652.","mla":"Yokota, Yoshifumi, et al. “Molecular Characterization of a Functional CDNA for Rat Substance P Receptor.” <i>Journal of Biological Chemistry</i>, vol. 264, no. 30, American Society for Biochemistry and Molecular Biology, 1989, pp. 17649–52, doi:<a href=\"https://doi.org/10.1016/S0021-9258(19)84619-7\">10.1016/S0021-9258(19)84619-7</a>.","ama":"Yokota Y, Sasai Y, Tanaka K, et al. Molecular characterization of a functional cDNA for rat substance P receptor. <i>Journal of Biological Chemistry</i>. 1989;264(30):17649-17652. doi:<a href=\"https://doi.org/10.1016/S0021-9258(19)84619-7\">10.1016/S0021-9258(19)84619-7</a>","ieee":"Y. Yokota <i>et al.</i>, “Molecular characterization of a functional cDNA for rat substance P receptor,” <i>Journal of Biological Chemistry</i>, vol. 264, no. 30. American Society for Biochemistry and Molecular Biology, pp. 17649–17652, 1989.","chicago":"Yokota, Yoshifumi, Yoshiki Sasai, Kohichi Tanaka, Tsutomu Fujiwara, Kunihiro Tsuchida, Ryuichi Shigemoto, Akira Kakizuka, Hiroaki Ohkubo, and Shigetada Nakanishi. “Molecular Characterization of a Functional CDNA for Rat Substance P Receptor.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 1989. <a href=\"https://doi.org/10.1016/S0021-9258(19)84619-7\">https://doi.org/10.1016/S0021-9258(19)84619-7</a>."},"external_id":{"pmid":["2478537"]},"publist_id":"4374","extern":"1","language":[{"iso":"eng"}],"issue":"30","_id":"2525","article_processing_charge":"No","date_updated":"2025-06-26T09:18:02Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"       264","publication":"Journal of Biological Chemistry","acknowledgement":"This work was supported in part by research grants from the Ministry of Education, Science and Culture of Japan, the Institute of Physical and Chemical Research, and the Science and Technology Agency of Japan. The costs of publication of this article were defrayed in part by the payment of page charges. This article must therefore be hereby marked “advertisement” in accordance with 18 U.S.C. Section 1734 solely to indicate this fact. ","publisher":"American Society for Biochemistry and Molecular Biology","publication_status":"published","volume":264,"date_published":"1989-10-25T00:00:00Z","oa_version":"Published Version","scopus_import":"1","page":"17649 - 17652","day":"25","year":"1989","doi":"10.1016/S0021-9258(19)84619-7","author":[{"first_name":"Yoshifumi","last_name":"Yokota","full_name":"Yokota, Yoshifumi"},{"full_name":"Sasai, Yoshiki","last_name":"Sasai","first_name":"Yoshiki"},{"full_name":"Tanaka, Kohichi","first_name":"Kohichi","last_name":"Tanaka"},{"full_name":"Fujiwara, Tsutomu","first_name":"Tsutomu","last_name":"Fujiwara"},{"full_name":"Tsuchida, Kunihiro","last_name":"Tsuchida","first_name":"Kunihiro"},{"orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"last_name":"Kakizuka","first_name":"Akira","full_name":"Kakizuka, Akira"},{"last_name":"Ohkubo","first_name":"Hiroaki","full_name":"Ohkubo, Hiroaki"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"}],"article_type":"original","title":"Molecular characterization of a functional cDNA for rat substance P receptor","month":"10","date_created":"2018-12-11T11:58:11Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/S0021-9258(19)84619-7"}],"abstract":[{"lang":"eng","text":"This paper describes the amino acid sequence of the rat substance P receptor and its comparison with that of the rat substance K receptor on the basis of molecular cloning and sequence analysis. From a rat brain cDNA library constructed with an RNA expression vector, we identified a cDNA mixture containing a functional substance P receptor cDNA by examining electrophysiologically a receptor expression following injection of the mRNAs synthesized in vitro into Xenopus oocytes. A receptor cDNA clone was then isolated by cross-hybridization with the bovine substance K receptor DNA. The clone was confirmed by selective binding of substance P to the cloned receptor expressed in mammalian COS cells. The deduced amino acid sequence (407 amino acid residues) possesses seven putative membrane spanning domains and shows a sequence similarity to the members of G-protein-coupled receptors. The rat substance P and substance K receptor are very similar in both size and amino acid sequences, particularly in the putative transmembrane similarity is in marked contrast to the sequence divergence in the amino- and carboxyl-terminal regions and the third cytoplasmic loop. The observed sequence similarytity and divergence would thus contribute to the expression of similar but pharmacological regions and the first and second cytoplasmic loops. This distinguishable activities of the two tachykinin receptors."}],"type":"journal_article","oa":1,"status":"public","quality_controlled":"1"},{"month":"02","title":"Direct projections from Ammon's horn to the rostral raphe regions in the brainstem of the cat","author":[{"first_name":"Tadashi","last_name":"Ino","full_name":"Ino, Tadashi"},{"full_name":"Itoh, Kazuo","last_name":"Itoh","first_name":"Kazuo"},{"last_name":"Kamiya","first_name":"Hiroto","full_name":"Kamiya, Hiroto"},{"full_name":"Kaneko, Takeshi","last_name":"Kaneko","first_name":"Takeshi"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Akiguchi, Ichiro","last_name":"Akiguchi","first_name":"Ichiro"},{"full_name":"Mizuno, Noboru","last_name":"Mizuno","first_name":"Noboru"}],"doi":"10.1016/0006-8993(89)91346-2","year":"1989","day":"06","page":"157 - 161","scopus_import":"1","article_type":"original","quality_controlled":"1","status":"public","abstract":[{"text":"When WGA-HRP (wheat germ agglutinin-horseradish peroxidase conjugate) or HRP was injected into the regions around the superior central and/or the dorsal raphe nuclei in the cat, cell bodies of a number of non-pyramidal neurons were labeled in Ammon's horn. Thus the existence of direct projections from non-pyramidal neurons in Ammon's horn to the rostral raphe regions in the brainstem was suggested in the cat.","lang":"eng"}],"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0006899389913462?via%3Dihub"}],"date_created":"2018-12-11T11:58:11Z","type":"journal_article","issue":"1","date_updated":"2022-02-15T09:14:43Z","article_processing_charge":"No","_id":"2526","external_id":{"pmid":["2466535 "]},"citation":{"mla":"Ino, Tadashi, et al. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.” <i>Brain Research</i>, vol. 479, no. 1, Elsevier, 1989, pp. 157–61, doi:<a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">10.1016/0006-8993(89)91346-2</a>.","ama":"Ino T, Itoh K, Kamiya H, et al. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. <i>Brain Research</i>. 1989;479(1):157-161. doi:<a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">10.1016/0006-8993(89)91346-2</a>","short":"T. Ino, K. Itoh, H. Kamiya, T. Kaneko, R. Shigemoto, I. Akiguchi, N. Mizuno, Brain Research 479 (1989) 157–161.","ista":"Ino T, Itoh K, Kamiya H, Kaneko T, Shigemoto R, Akiguchi I, Mizuno N. 1989. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. Brain Research. 479(1), 157–161.","apa":"Ino, T., Itoh, K., Kamiya, H., Kaneko, T., Shigemoto, R., Akiguchi, I., &#38; Mizuno, N. (1989). Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. <i>Brain Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">https://doi.org/10.1016/0006-8993(89)91346-2</a>","chicago":"Ino, Tadashi, Kazuo Itoh, Hiroto Kamiya, Takeshi Kaneko, Ryuichi Shigemoto, Ichiro Akiguchi, and Noboru Mizuno. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.” <i>Brain Research</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">https://doi.org/10.1016/0006-8993(89)91346-2</a>.","ieee":"T. Ino <i>et al.</i>, “Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat,” <i>Brain Research</i>, vol. 479, no. 1. Elsevier, pp. 157–161, 1989."},"publication_identifier":{"issn":["0006-8993"],"eissn":["1872-6240"]},"pmid":1,"language":[{"iso":"eng"}],"extern":"1","publist_id":"4373","publication_status":"published","publisher":"Elsevier","oa_version":"None","volume":479,"date_published":"1989-02-06T00:00:00Z","publication":"Brain Research","intvolume":"       479","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"The photographic help of Mr. Akira Uesugi, and the support of Niwa Medical Research Foundation are gratefully acknowledged. This work has been supported in part by Grant-in-Aid for Special Project Research (No. 63112003) and Grant-in-Aid for Scientific Research (No. 62480098) from the Ministry of Education, Science and Culture of Japan."},{"volume":86,"date_published":"1989-11-01T00:00:00Z","status":"public","quality_controlled":"1","oa_version":"None","publication_status":"published","publisher":"Japanese Society of Gastroenterology","type":"journal_article","date_created":"2018-12-11T11:58:12Z","intvolume":"        86","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Japanese Journal of Gastroenterology","main_file_link":[{"url":"https://www.jstage.jst.go.jp/article/nisshoshi1964/86/11/86_11_2627/_article/-char/ja/"}],"_id":"2527","title":"Effect of endothelin on gastric mucosal blood flow in rat","date_updated":"2022-02-15T09:06:39Z","month":"11","article_processing_charge":"No","issue":"11","article_type":"original","publist_id":"4372","extern":"1","language":[{"iso":"jpn"}],"citation":{"apa":"Akimoto M., Shigemoto R., Kawamura M., Yamagata H., Kurihara T., Takata S., … Yamauchi D. (1989). Effect of endothelin on gastric mucosal blood flow in rat. <i>Japanese Journal of Gastroenterology</i>. Japanese Society of Gastroenterology. <a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">https://doi.org/10.11405/nisshoshi1964.86.2627</a>","ama":"Akimoto M, Shigemoto R, Kawamura M, et al. Effect of endothelin on gastric mucosal blood flow in rat. <i>Japanese Journal of Gastroenterology</i>. 1989;86(11):2627. doi:<a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">10.11405/nisshoshi1964.86.2627</a>","mla":"Akimoto Masumi, et al. “Effect of endothelin on gastric mucosal blood flow in rat.” <i>Japanese Journal of Gastroenterology</i>, vol. 86, no. 11, Japanese Society of Gastroenterology, 1989, p. 2627, doi:<a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">10.11405/nisshoshi1964.86.2627</a>.","ista":"Akimoto M, Shigemoto R, Kawamura M, Yamagata H, Kurihara T, Takata S, Miwa Y, Akagami N, Katsu K, Yamauchi D. 1989. Effect of endothelin on gastric mucosal blood flow in rat. Japanese Journal of Gastroenterology. 86(11), 2627.","short":"Akimoto M., Shigemoto R., Kawamura M., Yamagata H., Kurihara T., Takata S., Miwa Y., Akagami N., Katsu K., Yamauchi D., Japanese Journal of Gastroenterology 86 (1989) 2627.","chicago":"Akimoto Masumi, Shigemoto Ryuichi, Kawamura Makiko, Yamagata Hideharu, Kurihara Takeshi, Takata S, Miwa Yoko, Akagami N, Katsu Kenichi, and Yamauchi D. “Effect of endothelin on gastric mucosal blood flow in rat.” <i>Japanese Journal of Gastroenterology</i>. Japanese Society of Gastroenterology, 1989. <a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">https://doi.org/10.11405/nisshoshi1964.86.2627</a>.","ieee":"Akimoto M. <i>et al.</i>, “Effect of endothelin on gastric mucosal blood flow in rat,” <i>Japanese Journal of Gastroenterology</i>, vol. 86, no. 11. Japanese Society of Gastroenterology, p. 2627, 1989."},"day":"01","page":"2627","scopus_import":"1","author":[{"first_name":"Masumi","last_name":"Akimoto","full_name":"Akimoto, Masumi"},{"orcid":"0000-0001-8761-9444","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kawamura","first_name":"Makiko","full_name":"Kawamura, Makiko"},{"last_name":"Yamagata","first_name":"Hideharu","full_name":"Yamagata, Hideharu"},{"full_name":"Kurihara, Takeshi","last_name":"Kurihara","first_name":"Takeshi"},{"full_name":"Takata, S","first_name":"S","last_name":"Takata"},{"last_name":"Miwa","first_name":"Yoko","full_name":"Miwa, Yoko"},{"last_name":"Akagami","first_name":"N","full_name":"Akagami, N"},{"full_name":"Katsu, Kenichi","last_name":"Katsu","first_name":"Kenichi"},{"full_name":"Yamauchi, D","first_name":"D","last_name":"Yamauchi"}],"doi":"10.11405/nisshoshi1964.86.2627","year":"1989"},{"publist_id":"111","extern":"1","language":[{"iso":"eng"}],"citation":{"ista":"Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.","short":"R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.","ama":"Alur R, Henzinger TA. A really temporal logic. In: <i>30th Annual Symposium on Foundations of Computer Science</i>. FCOS. IEEE; 1989:164-169. doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>","mla":"Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>30th Annual Symposium on Foundations of Computer Science</i>, IEEE, 1989, pp. 164–69, doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>.","apa":"Alur, R., &#38; Henzinger, T. A. (1989). A really temporal logic. In <i>30th Annual Symposium on Foundations of Computer Science</i> (pp. 164–169). Research Triangle Park, NC, USA: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>","ieee":"R. Alur and T. A. Henzinger, “A really temporal logic,” in <i>30th Annual Symposium on Foundations of Computer Science</i>, Research Triangle Park, NC, USA, 1989, pp. 164–169.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In <i>30th Annual Symposium on Foundations of Computer Science</i>, 164–69. FCOS. IEEE, 1989. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>."},"publication_identifier":{"issn":["0018-9162"],"eissn":["1558-0814"],"isbn":["0-8186-1982-1"]},"day":"01","page":"164 - 169","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"year":"1989","doi":"10.1109/SFCS.1989.63473","_id":"4596","title":"A really temporal logic","date_updated":"2022-02-09T10:40:13Z","article_processing_charge":"No","month":"01","series_title":"FCOS","type":"conference","acknowledgement":"We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance. Moshe Vardi and Joe Halpern gave us very helpful advice for refilling our undecidability results. ","conference":{"end_date":"1989-11-01","start_date":"1989-10-30","name":"FOCS: Foundations of Computer Science","location":"Research Triangle Park, NC, USA"},"date_created":"2018-12-11T12:09:40Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"30th Annual Symposium on Foundations of Computer Science","abstract":[{"text":"A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.","lang":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/63473"}],"status":"public","date_published":"1989-01-01T00:00:00Z","quality_controlled":"1","oa_version":"None","publication_status":"published","publisher":"IEEE"},{"type":"journal_article","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01870958"}],"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."}],"date_created":"2018-12-11T12:03:28Z","quality_controlled":"1","status":"public","article_type":"original","doi":"10.1007/BF01870958","year":"1989","author":[{"last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"page":"277 - 289","scopus_import":"1","day":"01","month":"12","title":"Temperature dependence of gating current in myelinated nerve fibers","publication":"Journal of Membrane Biology","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"       112","oa_version":"None","volume":112,"date_published":"1989-12-01T00:00:00Z","publisher":"Springer","publication_status":"published","language":[{"iso":"eng"}],"extern":"1","publist_id":"2922","external_id":{"pmid":["2559205 "]},"pmid":1,"publication_identifier":{"eissn":["1432-1424"],"issn":["0022-2631"]},"citation":{"ieee":"P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” <i>Journal of Membrane Biology</i>, vol. 112, no. 3. Springer, pp. 277–289, 1989.","chicago":"Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” <i>Journal of Membrane Biology</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF01870958\">https://doi.org/10.1007/BF01870958</a>.","apa":"Jonas, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. <i>Journal of Membrane Biology</i>. Springer. <a href=\"https://doi.org/10.1007/BF01870958\">https://doi.org/10.1007/BF01870958</a>","ista":"Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 112(3), 277–289.","short":"P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.","ama":"Jonas PM. Temperature dependence of gating current in myelinated nerve fibers. <i>Journal of Membrane Biology</i>. 1989;112(3):277-289. doi:<a href=\"https://doi.org/10.1007/BF01870958\">10.1007/BF01870958</a>","mla":"Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” <i>Journal of Membrane Biology</i>, vol. 112, no. 3, Springer, 1989, pp. 277–89, doi:<a href=\"https://doi.org/10.1007/BF01870958\">10.1007/BF01870958</a>."},"article_processing_charge":"No","date_updated":"2022-02-15T08:59:02Z","_id":"3465","issue":"3"},{"issue":"18","_id":"3466","date_updated":"2022-02-14T16:12:33Z","article_processing_charge":"No","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"citation":{"apa":"Jonas, P. M., Bräu, M., Hermsteiner, M., &#38; Vogel, W. (1989). Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.86.18.7238\">https://doi.org/10.1073/pnas.86.18.7238</a>","mla":"Jonas, Peter M., et al. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” <i>PNAS</i>, vol. 86, no. 18, National Academy of Sciences, 1989, pp. 7238–42, doi:<a href=\"https://doi.org/10.1073/pnas.86.18.7238\">10.1073/pnas.86.18.7238</a>.","ama":"Jonas PM, Bräu M, Hermsteiner M, Vogel W. Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. <i>PNAS</i>. 1989;86(18):7238-7242. doi:<a href=\"https://doi.org/10.1073/pnas.86.18.7238\">10.1073/pnas.86.18.7238</a>","ista":"Jonas PM, Bräu M, Hermsteiner M, Vogel W. 1989. Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. PNAS. 86(18), 7238–7242.","short":"P.M. Jonas, M. Bräu, M. Hermsteiner, W. Vogel, PNAS 86 (1989) 7238–7242.","chicago":"Jonas, Peter M, Michael Bräu, Markus Hermsteiner, and Werner Vogel. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” <i>PNAS</i>. National Academy of Sciences, 1989. <a href=\"https://doi.org/10.1073/pnas.86.18.7238\">https://doi.org/10.1073/pnas.86.18.7238</a>.","ieee":"P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels,” <i>PNAS</i>, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989."},"pmid":1,"external_id":{"pmid":["2550937 "]},"publist_id":"2921","extern":"1","language":[{"iso":"eng"}],"publication_status":"published","publisher":"National Academy of Sciences","volume":86,"date_published":"1989-09-01T00:00:00Z","oa_version":"Published Version","intvolume":"        86","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"PNAS","acknowledgement":"We thank Drs. C. Baumann, D. Siemen, and W. Stuhmer for reading the manuscript and Dr. F. Dreyer for the generous gift of DTX. The study was supported by the Deutsche Forschungsgemeinschaft.","title":"Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels","month":"09","day":"01","page":"7238 - 7242","author":[{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"},{"full_name":"Bräu, Michael","first_name":"Michael","last_name":"Bräu"},{"full_name":"Hermsteiner, Markus","last_name":"Hermsteiner","first_name":"Markus"},{"full_name":"Vogel, Werner","last_name":"Vogel","first_name":"Werner"}],"year":"1989","doi":"10.1073/pnas.86.18.7238","article_type":"original","status":"public","quality_controlled":"1","date_created":"2018-12-11T12:03:28Z","abstract":[{"lang":"eng","text":"Amphibian myelinated nerve fibers were treated with collagenase and protease. Axons with retraction of the myelin sheath were patch-clamped in the nodal and paranodal region. One type of Na channel was found. It has a single-channel conductance of 11 pS (15 degrees C) and is blocked by tetrodotoxin. Averaged events show the typical activation and inactivation kinetics of macroscopic Na current. Three potential-dependent K channels were identified (I, F, and S channel). The I channel, being the most frequent type, has a single-channel conductance of 23 pS (inward current, 105 mM K on both sides of the membrane), activates between -60 and -30 mV, deactivates with intermediate kinetics, and is sensitive to dendrotoxin. The F channel has a conductance of 30 pS, activates between -40 and 60 mV, and deactivates with fast kinetics. The former inactivates within tens of seconds; the latter inactivates within seconds. The third type, the S channel, has a conductance of 7 pS and deactivates slowly. All three channels can be blocked by external tetraethylammonium chloride. We suggest that these distinct K channel types form the basis for the different components of macroscopic K current described previously."}],"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC298032/?tool=pubmed"}],"type":"journal_article","oa":1},{"_id":"3549","title":"Spatial triangulations with dihedral angle conditions","date_updated":"2022-02-14T14:34:06Z","article_processing_charge":"No","month":"01","citation":{"ieee":"H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.","chicago":"Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.","ista":"Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.","short":"H. Edelsbrunner, in:, Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.","mla":"Edelsbrunner, Herbert. <i>Spatial Triangulations with Dihedral Angle Conditions</i>. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.","ama":"Edelsbrunner H. Spatial triangulations with dihedral angle conditions. In: Institute of the Electronics, Information and Communication Enginneers; 1989:83-89.","apa":"Edelsbrunner, H. (1989). Spatial triangulations with dihedral angle conditions (pp. 83–89). Presented at the International Workshop on Discrete Algorithms and Complexity, Institute of the Electronics, Information and Communication Enginneers."},"day":"01","page":"83 - 89","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"year":"1989","extern":"1","publist_id":"2836","language":[{"iso":"eng"}],"publication_status":"published","publisher":"Institute of the Electronics, Information and Communication Enginneers","status":"public","date_published":"1989-01-01T00:00:00Z","quality_controlled":"1","oa_version":"None","date_created":"2018-12-11T12:03:54Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"We study three types of spatial triangulations: Delaunay triangulations, triangulations with non-obtuse dihedral angles, and KJ-triangulations. The latter satisfy a certain angle condition useful for finite element approximation. We show that the condition for Delaunay triangulations is incomparable with the other two conditions, and that triangulations with non-obtuse dihedral angles are necessarily also KJ-triangulations. These relationships are in sharp contrast to the ones in the planar case. ","lang":"eng"}],"main_file_link":[{"url":"https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=32670&item_no=1&page_id=13&block_id=8"}],"type":"conference","acknowledgement":"Research was supported by the National Science Foundation under grant CCR-8714565.  The author thanks Thomas Kerkhoven, Raimund Seidel, and Peter Shor for helpful discussions on the material of this paper. ","conference":{"name":"International Workshop on Discrete Algorithms and Complexity"}},{"title":"Inference from clines stabilized by frequency-dependent selection","month":"08","article_type":"original","day":"01","scopus_import":"1","page":"967 - 976","author":[{"full_name":"Mallet, James","last_name":"Mallet","first_name":"James"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"doi":"10.1093/genetics/122.4.967","year":"1989","status":"public","quality_controlled":"1","type":"journal_article","oa":1,"date_created":"2018-12-11T12:04:27Z","abstract":[{"text":"Frequency-dependent selection against rare forms can maintain clines. For weak selection, s, in simple linear models of frequency-dependence, single locus clines are stabilized with a maximum slope of between square root of s/square root of 8 sigma and square root of s/square root of 12 delta, where sigma is the dispersal distance. These clines are similar to those maintained by heterozygote disadvantage. Using computer simulations, the weak-selection analytical results are extended to higher selection pressures with up to three unlinked genes. Graphs are used to display the effect of selection, migration, dominance, and number of loci on cline widths, speeds of cline movements, two-way gametic correlations (\"linkage disequilibria\"), and heterozygote deficits. The effects of changing the order of reproduction, migration, and selection, are also briefly explored. Epistasis can also maintain tension zones. We show that epistatic selection is similar in its effects to frequency-dependent selection, except that the disequilibria produced in the zone will be higher for a given level of selection. If selection consists of a mixture of frequency-dependence and epistasis, as is likely in nature, the error made in estimating selection is usually less than twofold. From the graphs, selection and migration can be estimated using knowledge of the dominance and number of genes, of gene frequencies and of gametic correlations from a hybrid zone.","lang":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203771","open_access":"1"}],"_id":"3652","date_updated":"2022-02-14T14:07:12Z","article_processing_charge":"No","issue":"4","extern":"1","publist_id":"2731","language":[{"iso":"eng"}],"citation":{"chicago":"Mallet, James, and Nicholas H Barton. “Inference from Clines Stabilized by Frequency-Dependent Selection.” <i>Genetics</i>. Genetics Society of America, 1989. <a href=\"https://doi.org/10.1093/genetics/122.4.967\">https://doi.org/10.1093/genetics/122.4.967</a>.","ieee":"J. Mallet and N. H. Barton, “Inference from clines stabilized by frequency-dependent selection,” <i>Genetics</i>, vol. 122, no. 4. Genetics Society of America, pp. 967–976, 1989.","apa":"Mallet, J., &#38; Barton, N. H. (1989). Inference from clines stabilized by frequency-dependent selection. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/122.4.967\">https://doi.org/10.1093/genetics/122.4.967</a>","mla":"Mallet, James, and Nicholas H. Barton. “Inference from Clines Stabilized by Frequency-Dependent Selection.” <i>Genetics</i>, vol. 122, no. 4, Genetics Society of America, 1989, pp. 967–76, doi:<a href=\"https://doi.org/10.1093/genetics/122.4.967\">10.1093/genetics/122.4.967</a>.","ama":"Mallet J, Barton NH. Inference from clines stabilized by frequency-dependent selection. <i>Genetics</i>. 1989;122(4):967-976. doi:<a href=\"https://doi.org/10.1093/genetics/122.4.967\">10.1093/genetics/122.4.967</a>","ista":"Mallet J, Barton NH. 1989. Inference from clines stabilized by frequency-dependent selection. Genetics. 122(4), 967–976.","short":"J. Mallet, N.H. Barton, Genetics 122 (1989) 967–976."},"publication_identifier":{"issn":["0016-6731"]},"pmid":1,"external_id":{"pmid":["2759433"]},"date_published":"1989-08-01T00:00:00Z","volume":122,"oa_version":"None","publication_status":"published","publisher":"Genetics Society of America","acknowledgement":"The publication costs of this article were partly defrayed by the payment of page charges. This article must therefore be hereby marked “advertisment” in accordance with 18 U.S.C. §1734 solely to indicate this fact. \r\n\r\nWe thank the Natural Environmental Research Council for financial support, and N. SANDERSON, M. SLATKIN and an anonymous reviewer for comments on the manuscript.","intvolume":"       122","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Genetics"},{"_id":"3653","date_updated":"2022-02-14T11:00:42Z","article_processing_charge":"No","issue":"2","extern":"1","publist_id":"2730","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"citation":{"ieee":"J. Mallet and N. H. Barton, “Strong natural selection in a warning color hybrid zone,” <i>Evolution</i>, vol. 43, no. 2. Wiley-Blackwell, pp. 421–431, 1989.","chicago":"Mallet, James, and Nicholas H Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” <i>Evolution</i>. Wiley-Blackwell, 1989. <a href=\"https://doi.org/10.2307/2409217 \">https://doi.org/10.2307/2409217 </a>.","apa":"Mallet, J., &#38; Barton, N. H. (1989). Strong natural selection in a warning color hybrid zone. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.2307/2409217 \">https://doi.org/10.2307/2409217 </a>","ista":"Mallet J, Barton NH. 1989. Strong natural selection in a warning color hybrid zone. Evolution. 43(2), 421–431.","short":"J. Mallet, N.H. Barton, Evolution 43 (1989) 421–431.","mla":"Mallet, James, and Nicholas H. Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” <i>Evolution</i>, vol. 43, no. 2, Wiley-Blackwell, 1989, pp. 421–31, doi:<a href=\"https://doi.org/10.2307/2409217 \">10.2307/2409217 </a>.","ama":"Mallet J, Barton NH. Strong natural selection in a warning color hybrid zone. <i>Evolution</i>. 1989;43(2):421-431. doi:<a href=\"https://doi.org/10.2307/2409217 \">10.2307/2409217 </a>"},"pmid":1,"external_id":{"pmid":["28568556 "]},"volume":43,"date_published":"1989-01-01T00:00:00Z","oa_version":"None","publication_status":"published","publisher":"Wiley-Blackwell","acknowledgement":"We thank G.Lamas for sharing his knowledge of the Tarapoto hybrid zone;  M.A.Arboleda, H.Eeley, S.Knapp, M.Muedas, and J.Santisteban for their help in the field;  P.Donnelly and C.Smith for statistical advice; and S.Jones, S.Knapp, G.Lamas, and the reviewers for helpful comments on the manuscript. We are grateful to the Natural Environment Research Council, the Royal Society, and the Nuffield Foundation for funding this research.","intvolume":"        43","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Evolution","title":"Strong natural selection in a warning color hybrid zone","month":"01","article_type":"original","day":"01","page":"421 - 431","scopus_import":"1","author":[{"full_name":"Mallet, James","first_name":"James","last_name":"Mallet"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"year":"1989","doi":"10.2307/2409217 ","status":"public","quality_controlled":"1","type":"journal_article","date_created":"2018-12-11T12:04:27Z","abstract":[{"text":"Frequency-dependent selection on warning color can maintain narrow hybrid zones between unpalatable prey taxa. To measure such selection, we transferred marked Heliconius erato (Lepidoptera: Nymphalidae) in both directions across a 10-km-wide hybrid zone between Peruvian races differing in color pattern. These experimental H. erato were released at four sites, along with control H. erato of the phenotype native to each site. Survival of experimental butterflies was significantly lower than that of controls at two sites and overall. Most selection, measured as differences in survival, occurred soon after release. Selection against foreign morphs was 52% (confidence limits: 25-71%) and was probably due to bird attacks on unusual warning-color morphs (more than 10% of the recaptures had beak marks). Since only three major loci determine the color-pattern differences, this suggests an average selection coefficient of 0.17 per locus, sufficient to maintain the narrow clines in H. erato.","lang":"eng"}],"main_file_link":[{"url":"https://www.jstor.org/stable/2409217?origin=crossref&seq=1#metadata_info_tab_contents"}]},{"scopus_import":"1","page":"497 - 503","day":"12","doi":"10.1038/341497a0","year":"1989","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hewitt, Godfrey","last_name":"Hewitt","first_name":"Godfrey"}],"article_type":"original","title":"Adaptation, speciation and hybrid zones","month":"10","date_created":"2018-12-11T12:04:27Z","main_file_link":[{"url":"https://www.nature.com/articles/341497a0"}],"abstract":[{"lang":"eng","text":"Many species are divided into a mosaic of genetically distinct populations, separated by narrow zones of hybridization. Studies of hybrid zones allow us to quantify the genetic differences responsible for speciation, to measure the diffusion of genes between diverging taxa, and to understand the spread of alternative adaptations."}],"type":"journal_article","status":"public","quality_controlled":"1","pmid":1,"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"citation":{"ieee":"N. H. Barton and G. Hewitt, “Adaptation, speciation and hybrid zones,” <i>Nature</i>, vol. 341. Nature Publishing Group, pp. 497–503, 1989.","chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Adaptation, Speciation and Hybrid Zones.” <i>Nature</i>. Nature Publishing Group, 1989. <a href=\"https://doi.org/10.1038/341497a0\">https://doi.org/10.1038/341497a0</a>.","apa":"Barton, N. H., &#38; Hewitt, G. (1989). Adaptation, speciation and hybrid zones. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/341497a0\">https://doi.org/10.1038/341497a0</a>","ista":"Barton NH, Hewitt G. 1989. Adaptation, speciation and hybrid zones. Nature. 341, 497–503.","short":"N.H. Barton, G. Hewitt, Nature 341 (1989) 497–503.","ama":"Barton NH, Hewitt G. Adaptation, speciation and hybrid zones. <i>Nature</i>. 1989;341:497-503. doi:<a href=\"https://doi.org/10.1038/341497a0\">10.1038/341497a0</a>","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Adaptation, Speciation and Hybrid Zones.” <i>Nature</i>, vol. 341, Nature Publishing Group, 1989, pp. 497–503, doi:<a href=\"https://doi.org/10.1038/341497a0\">10.1038/341497a0</a>."},"external_id":{"pmid":["2677747 "]},"extern":"1","publist_id":"2729","language":[{"iso":"eng"}],"_id":"3654","article_processing_charge":"No","date_updated":"2022-02-14T10:13:44Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"       341","publication":"Nature","publisher":"Nature Publishing Group","publication_status":"published","date_published":"1989-10-12T00:00:00Z","volume":341,"oa_version":"None"},{"publist_id":"2042","extern":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1930-0972"],"issn":["0002-9890"]},"citation":{"mla":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18, doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>.","ama":"Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. 1989;96(7):614-618. doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>","ista":"Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.","short":"H. Edelsbrunner, S. Skiena, American Mathematical Monthly 96 (1989) 614–618.","apa":"Edelsbrunner, H., &#38; Skiena, S. (1989). On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>","chicago":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>. Mathematical Association of America, 1989. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>.","ieee":"H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in a point set,” <i>American Mathematical Monthly</i>, vol. 96, no. 7. Mathematical Association of America, pp. 614–618, 1989."},"_id":"4079","article_processing_charge":"No","date_updated":"2022-02-11T12:59:01Z","issue":"7","acknowledgement":"Research supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"        96","publication":"American Mathematical Monthly","volume":96,"date_published":"1989-01-01T00:00:00Z","oa_version":"None","publisher":"Mathematical Association of America","publication_status":"published","article_type":"original","page":"614 - 618","day":"01","doi":"10.1080/00029890.1989.11972250","year":"1989","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Skiena, Steven","first_name":"Steven","last_name":"Skiena"}],"title":"On the number of furthest neighbor pairs in a point set","month":"01","type":"journal_article","date_created":"2018-12-11T12:06:49Z","main_file_link":[{"url":"http://www.jstor.org/stable/2325182 "}],"status":"public","quality_controlled":"1"},{"language":[{"iso":"eng"}],"publist_id":"2043","extern":"1","publication_identifier":{"eissn":["1572-9168"],"issn":["0046-5755"]},"citation":{"chicago":"Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles through Two Points That Always Enclose Many Points.” <i>Geometriae Dedicata</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF00181432\">https://doi.org/10.1007/BF00181432</a>.","ieee":"H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points that always enclose many points,” <i>Geometriae Dedicata</i>, vol. 32, no. 1. Springer, pp. 1–12, 1989.","apa":"Edelsbrunner, H., Hasan, N., Seidel, R., &#38; Shen, X. (1989). Circles through two points that always enclose many points. <i>Geometriae Dedicata</i>. Springer. <a href=\"https://doi.org/10.1007/BF00181432\">https://doi.org/10.1007/BF00181432</a>","mla":"Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” <i>Geometriae Dedicata</i>, vol. 32, no. 1, Springer, 1989, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/BF00181432\">10.1007/BF00181432</a>.","ama":"Edelsbrunner H, Hasan N, Seidel R, Shen X. Circles through two points that always enclose many points. <i>Geometriae Dedicata</i>. 1989;32(1):1-12. doi:<a href=\"https://doi.org/10.1007/BF00181432\">10.1007/BF00181432</a>","short":"H. Edelsbrunner, N. Hasan, R. Seidel, X. Shen, Geometriae Dedicata 32 (1989) 1–12.","ista":"Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12."},"date_updated":"2022-02-14T09:55:28Z","article_processing_charge":"No","_id":"4080","issue":"1","acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565, by the second author has been partially supported by the Digital Equipment Corporation, by the fourth author has been partially supported by the Office of Naval Research under Grant N00014-86K-0416.","publication":"Geometriae Dedicata","intvolume":"        32","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","date_published":"1989-10-01T00:00:00Z","volume":32,"publication_status":"published","publisher":"Springer","article_type":"original","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Hasan, Nany","first_name":"Nany","last_name":"Hasan"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"last_name":"Shen","first_name":"Xiao","full_name":"Shen, Xiao"}],"year":"1989","doi":"10.1007/BF00181432","day":"01","page":"1 - 12","scopus_import":"1","month":"10","title":"Circles through two points that always enclose many points","type":"journal_article","abstract":[{"text":"This paper proves that any set of n points in the plane contains two points such that any circle through those two points encloses at least n12−112+O(1)n47  points of the set. The main ingredients used in the proof of this result are edge counting formulas for k-order Voronoi diagrams and a lower bound on the minimum number of semispaces of size at most k.","lang":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00181432"}],"date_created":"2018-12-11T12:06:49Z","quality_controlled":"1","status":"public"},{"issue":"1","article_processing_charge":"No","date_updated":"2022-02-10T15:53:48Z","_id":"4081","citation":{"chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>.","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 311–336, 1989.","mla":"Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>.","ama":"Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):311-336. doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 4 (1989) 311–336.","ista":"Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &#38; Computational Geometry. 4(1), 311–336.","apa":"Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>"},"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"language":[{"iso":"eng"}],"publist_id":"2038","extern":"1","publisher":"Springer","publication_status":"published","oa_version":"Published Version","volume":4,"date_published":"1989-12-01T00:00:00Z","publication":"Discrete & Computational Geometry","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"         4","acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. Work by the third author has been supported by the Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and the IBM Corporation, and by a research grant from NCRD, the Israeli National Council for Research and Development.","month":"12","title":"The upper envelope of piecewise linear functions: Algorithms and applications","doi":"10.1007/BF02187733","year":"1989","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"page":"311 - 336","day":"01","article_type":"original","quality_controlled":"1","status":"public","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187733"}],"abstract":[{"lang":"eng","text":"This paper studies applications of envelopes of piecewise linear functions to problems in computational geometry. Among these applications we find problems involving hidden line/surface elimination, motion planning, transversals of polytopes, and a new type of Voronoi diagram for clusters of points. All results are either combinatorial or computational in nature. They are based on the combinatorial analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm for computing envelopes described in this paper."}],"date_created":"2018-12-11T12:06:50Z","oa":1,"type":"journal_article"},{"citation":{"ieee":"H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1. Elsevier, pp. 165–194, 1989.","chicago":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>.","short":"H. Edelsbrunner, L. Guibas, Journal of Computer and System Sciences 38 (1989) 165–194.","ista":"Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.","mla":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>.","ama":"Edelsbrunner H, Guibas L. Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. 1989;38(1):165-194. doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>","apa":"Edelsbrunner, H., &#38; Guibas, L. (1989). Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>"},"publication_identifier":{"eissn":["1090-2724"],"issn":["0022-0000"]},"extern":"1","publist_id":"2039","language":[{"iso":"eng"}],"issue":"1","_id":"4082","date_updated":"2022-02-10T16:06:05Z","article_processing_charge":"No","intvolume":"        38","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Journal of Computer and System Sciences","acknowledgement":"he authors wish to thank Raimund Seidel for suggesting the argument that we used to prove Theorem 3.1, Harald Rosenberger who implemented the topological sweep and compared it with a straight line sweep, the students who took the Stanford 1985 analysis of algorithms qualifying examination and suffered through a version of this problem, and finally Lyle Ramshaw and Cynthia Hibbard for their detailed reading and comments on the manuscript. The constructive criticism of an anonymous referee is also appreciated.","publication_status":"published","publisher":"Elsevier","date_published":"1989-02-01T00:00:00Z","volume":38,"oa_version":"Published Version","day":"01","scopus_import":"1","page":"165 - 194","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"}],"doi":"10.1016/0022-0000(89)90038-X","year":"1989","article_type":"original","title":"Topologically sweeping an arrangement","month":"02","date_created":"2018-12-11T12:06:50Z","abstract":[{"lang":"eng","text":"Sweeping a collection of figures in the Euclidean plane with a straight line is one of the novel algorithmic paradigms that have emerged in the field of computational geometry. In this paper we demonstrate the advantages of sweeping with a topological line that is not necessarily straight. We show how an arrangement of n lines in the plane can be swept over in O(n2) time and O(n) space by a such a line. In the process each element, i.e., vertex, edge, or region, is visited once in a consistent ordering. Our technique makes use of novel data structures which exhibit interesting amortized complexity behavior; the result is an algorithm that improves upon all its predecessors either in the space or the time bounds, as well as being eminently practical. Numerous applications of the technique to problems in computational geometry are given—many through the use of duality transforms. Examples include solving visibility problems, detecting degeneracies in configurations, computing the extremal shadows of convex polytopes, and others. Even though our basic technique solves a planar problem, its applications include several problems in higher dimensions."}],"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002200008990038X?via%3Dihub","open_access":"1"}],"type":"journal_article","oa":1,"status":"public","quality_controlled":"1"},{"issue":"2","_id":"4083","article_processing_charge":"No","date_updated":"2022-02-11T07:55:48Z","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"citation":{"chicago":"Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>. SIAM, 1989. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>.","ieee":"F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” <i>SIAM Journal on Computing</i>, vol. 18, no. 2. SIAM, pp. 371–384, 1989.","apa":"Yao, F., Dobkin, D., Edelsbrunner, H., &#38; Paterson, M. (1989). Partitioning space for range queries. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>","ama":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. <i>SIAM Journal on Computing</i>. 1989;18(2):371-384. doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>","mla":"Yao, F., et al. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>.","short":"F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.","ista":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384."},"publist_id":"2040","extern":"1","language":[{"iso":"eng"}],"publisher":"SIAM","publication_status":"published","date_published":"1989-04-01T00:00:00Z","volume":18,"oa_version":"Published Version","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"        18","publication":"SIAM Journal on Computing","title":"Partitioning space for range queries","month":"04","scopus_import":"1","page":"371 - 384","day":"01","doi":"10.1137/0218025","year":"1989","author":[{"full_name":"Yao, F.","first_name":"F.","last_name":"Yao"},{"full_name":"Dobkin, David","last_name":"Dobkin","first_name":"David"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Michael","last_name":"Paterson","full_name":"Paterson, Michael"}],"article_type":"original","status":"public","quality_controlled":"1","date_created":"2018-12-11T12:06:50Z","main_file_link":[{"open_access":"1","url":"https://epubs.siam.org/doi/10.1137/0218025"}],"abstract":[{"lang":"eng","text":"It is shown that, given a set S of n points in $R^3 $, one can always find three planes that form an eight-partition of S, that is, a partition where at most ${n / 8}$ points of S lie in each of the eight open regions. This theorem is used to define a data structure, called an octant tree, for representing any point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can be constructed in polynomial time. With this data structure and its refinements, efficient solutions to various range query problems in two and three dimensions can be obtained, including (1) half-space queries: find all points of S that lie to one side of any given plane; (2) polyhedron queries: find all points that lie inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a planar set S, find all points that lie inside (outside) any given circle. The retrieval time for all these queries is $T(n) = O(n^\\alpha + m)$, where $\\alpha = 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance is the best currently known for linear-space data structures that can be deterministically constructed in polynomial time."}],"type":"journal_article","oa":1},{"type":"journal_article","oa":1,"date_created":"2018-12-11T12:06:51Z","abstract":[{"lang":"eng","text":"A tour  of a finite set P of points is a necklace-tour if there are disks with the points in P as centers such that two disks intersect if and only if their centers are adjacent in . It has been observed by Sanders that a necklace-tour is an optimal traveling salesman tour.\r\n\r\nIn this paper, we present an algorithm that either reports that no necklace-tour exists or outputs a necklace-tour of a given set of n points in O(n2 log n) time. If a tour is given, then we can test in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can be generalized to ƒ-factors of point sets in the plane. The complexity results rely on a combinatorial analysis of certain intersection graphs of disks defined for finite sets of points in the plane."}],"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0304397589901333?via%3Dihub"}],"status":"public","quality_controlled":"1","article_type":"original","day":"01","scopus_import":"1","page":"157 - 180","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Günter","last_name":"Rote","full_name":"Rote, Günter"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"doi":"10.1016/0304-3975(89)90133-3","year":"1989","title":"Testing the necklace condition for shortest tours and optimal factors in the plane","month":"08","intvolume":"        66","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Theoretical Computer Science","date_published":"1989-08-01T00:00:00Z","volume":66,"oa_version":"Published Version","publication_status":"published","publisher":"Elsevier","publist_id":"2041","extern":"1","language":[{"iso":"eng"}],"citation":{"apa":"Edelsbrunner, H., Rote, G., &#38; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>","short":"H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.","ista":"Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.","mla":"Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>.","ama":"Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. 1989;66(2):157-180. doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>","ieee":"H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” <i>Theoretical Computer Science</i>, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.","chicago":"Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>."},"publication_identifier":{"eissn":["1879-2294"],"issn":["0304-3975"]},"_id":"4084","date_updated":"2022-02-11T11:15:43Z","article_processing_charge":"No","issue":"2"},{"article_processing_charge":"No","month":"06","date_updated":"2022-02-10T10:56:49Z","title":"An acyclicity theorem for cell complexes in d dimension","_id":"4085","language":[{"iso":"eng"}],"publist_id":"2033","extern":"1","year":"1989","doi":"10.1145/73833.73850","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"page":"145 - 151","scopus_import":"1","citation":{"apa":"Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension. In <i>Proceedings of the 5th annual symposium on Computational geometry</i> (pp. 145–151). Saarbruchen, Germany: ACM. <a href=\"https://doi.org/10.1145/73833.73850\">https://doi.org/10.1145/73833.73850</a>","ista":"Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.","short":"H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–151.","mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>, ACM, 1989, pp. 145–51, doi:<a href=\"https://doi.org/10.1145/73833.73850\">10.1145/73833.73850</a>.","ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. In: <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>. ACM; 1989:145-151. doi:<a href=\"https://doi.org/10.1145/73833.73850\">10.1145/73833.73850</a>","ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in <i>Proceedings of the 5th annual symposium on Computational geometry</i>, Saarbruchen, Germany, 1989, pp. 145–151.","chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” In <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>, 145–51. ACM, 1989. <a href=\"https://doi.org/10.1145/73833.73850\">https://doi.org/10.1145/73833.73850</a>."},"publication_identifier":{"isbn":["978-0-89791-318-8"]},"day":"01","oa_version":"None","quality_controlled":"1","status":"public","date_published":"1989-06-01T00:00:00Z","publisher":"ACM","publication_status":"published","conference":{"location":"Saarbruchen, Germany","name":"SCG: Symposium on Computational Geometry","start_date":"1989-06-05","end_date":"1989-06-07"},"type":"conference","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/73833.73850"}],"publication":"Proceedings of the 5th annual symposium on Computational geometry","abstract":[{"text":"Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:06:51Z"},{"date_published":"1989-11-01T00:00:00Z","volume":4,"oa_version":"Published Version","publisher":"Springer","publication_status":"published","acknowledgement":"This work was supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565. Research on the presented result was partially carried out while the author worked for the IBM T. J. Watson Research Center at Yorktown Height, New York, USA. \r\n","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"         4","publication":"Discrete & Computational Geometry","_id":"4086","article_processing_charge":"No","date_updated":"2022-02-10T11:08:12Z","issue":"4","publist_id":"2034","extern":"1","language":[{"iso":"eng"}],"citation":{"chicago":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>.","ieee":"H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4. Springer, pp. 337–343, 1989.","ama":"Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. 1989;4(4):337-343. doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>","mla":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>.","short":"H. Edelsbrunner, Discrete &#38; Computational Geometry 4 (1989) 337–343.","ista":"Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &#38; Computational Geometry. 4(4), 337–343.","apa":"Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>"},"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"status":"public","quality_controlled":"1","type":"journal_article","oa":1,"date_created":"2018-12-11T12:06:51Z","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187734","open_access":"1"}],"abstract":[{"lang":"eng","text":"This note proves that the maximum number of faces (of any dimension) of the upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove the same bound for the number ofd-dimensional faces of the upper envelope."}],"title":"The upper envelope of piecewise linear functions: Tight bounds on the number of faces ","month":"11","article_type":"original","page":"337 - 343","scopus_import":"1","day":"01","year":"1989","doi":"10.1007/BF02187734","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}]},{"oa_version":"None","volume":358,"date_published":"1989-09-20T00:00:00Z","publication_status":"published","publisher":"Springer","acknowledgement":"Research of the first author is supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862, the second author is supported by NSF Grant ECS 84-10902, and research of the third author is supported in part by ONR Grant N00014-85K0570 and by NSF Grant DMS 8504","alternative_title":["LNCS"],"conference":{"end_date":"1988-07-08","location":"Rome, Italy","name":"ISSAC: International Symposium on Symbolic and Algebraic Computation","start_date":"1988-07-04"},"publication":" International Symposium on Symbolic and Algebraic Computation","intvolume":"       358","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-10T13:27:41Z","article_processing_charge":"No","_id":"4087","language":[{"iso":"eng"}],"extern":"1","publist_id":"2035","citation":{"apa":"Edelsbrunner, H., Preparata, F., &#38; West, D. (1989). Tetrahedrizing point sets in three dimensions. In <i> International Symposium on Symbolic and Algebraic Computation</i> (Vol. 358, pp. 315–331). Rome, Italy: Springer. <a href=\"https://doi.org/10.1007/3-540-51084-2_31\">https://doi.org/10.1007/3-540-51084-2_31</a>","mla":"Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” <i> International Symposium on Symbolic and Algebraic Computation</i>, vol. 358, Springer, 1989, pp. 315–31, doi:<a href=\"https://doi.org/10.1007/3-540-51084-2_31\">10.1007/3-540-51084-2_31</a>.","ama":"Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. In: <i> International Symposium on Symbolic and Algebraic Computation</i>. Vol 358. Springer; 1989:315-331. doi:<a href=\"https://doi.org/10.1007/3-540-51084-2_31\">10.1007/3-540-51084-2_31</a>","ista":"Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions.  International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.","short":"H. Edelsbrunner, F. Preparata, D. West, in:,  International Symposium on Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.","chicago":"Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” In <i> International Symposium on Symbolic and Algebraic Computation</i>, 358:315–31. Springer, 1989. <a href=\"https://doi.org/10.1007/3-540-51084-2_31\">https://doi.org/10.1007/3-540-51084-2_31</a>.","ieee":"H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” in <i> International Symposium on Symbolic and Algebraic Computation</i>, Rome, Italy, 1989, vol. 358, pp. 315–331."},"quality_controlled":"1","status":"public","type":"conference","abstract":[{"text":"This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are coplanar. It also presents an algorithm that in O(nlog n) time constructs a tetrahedrization of a set of n points consisting of at most 3n–11 tetrahedra.","lang":"eng"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-51084-2_31"}],"date_created":"2018-12-11T12:06:52Z","month":"09","title":"Tetrahedrizing point sets in three dimensions","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Preparata, Franco","last_name":"Preparata","first_name":"Franco"},{"full_name":"West, Douglas","last_name":"West","first_name":"Douglas"}],"year":"1989","doi":"10.1007/3-540-51084-2_31","day":"20","scopus_import":"1","page":"315 - 331"}]