[{"month":"01","acknowledgement":"We  wish  to  thank  an  anonymous  referee  for  pointing  out the  PSPACE-fragment  of  Section  4.5.  T. A. Henzinger was supported in part by the Office of Naval Research Young Investigator award NOOO14-95-l-0520, by the National Science Foundation CAREER award CCR 9501708, by the National Science Foundation grants CCR 92-00794 and CCR 9504469, by the Air Force Office of Scientific Research contract F49620-93-l-0056, and by the Advanced Research Projects Agency grant NAG2-892. ","extern":"1","quality_controlled":"1","abstract":[{"text":"The  most  natural,  compositional,  way  of  modeling  real-time  systems  uses  a  dense domain  for  time.  The  satisfiability  of  timing  constraints  that  are  capable  of  expressing  punctuality in  this  model,  however,  is  known  to  be  undecidable.  We  introduce  a  temporal  language  that  can constrain  the  time  difference  between  events  only  with  finite,  yet  arbitrary,  precision  and  show  the resulting  logic  to  be  EXPSPACE-complete.  This  result  allows  us  to  develop  an  algorithm  for  the verification  of  timing  properties  of  real-time  systems  with  a  dense  semantics.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publication":"Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing","_id":"4621","title":"The benefits of relaxing punctuality","publisher":"ACM","doi":"10.1145/227595.227602","date_updated":"2022-02-24T13:27:20Z","oa_version":"None","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/227595.227602"}],"citation":{"ista":"Alur R, Feder T, Henzinger TA. 1991. The benefits of relaxing punctuality. Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 139–152.","apa":"Alur, R., Feder, T., &#38; Henzinger, T. A. (1991). The benefits of relaxing punctuality. In <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 139–152). Montreal, Canada: ACM. <a href=\"https://doi.org/10.1145/227595.227602\">https://doi.org/10.1145/227595.227602</a>","ieee":"R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” in <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>, Montreal, Canada, 1991, pp. 139–152.","short":"R. Alur, T. Feder, T.A. Henzinger, in:, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1991, pp. 139–152.","ama":"Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality. In: <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>. ACM; 1991:139-152. doi:<a href=\"https://doi.org/10.1145/227595.227602\">10.1145/227595.227602</a>","mla":"Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.” <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>, ACM, 1991, pp. 139–52, doi:<a href=\"https://doi.org/10.1145/227595.227602\">10.1145/227595.227602</a>.","chicago":"Alur, Rajeev, Tomás Feder, and Thomas A Henzinger. “The Benefits of Relaxing Punctuality.” In <i>Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing</i>, 139–52. ACM, 1991. <a href=\"https://doi.org/10.1145/227595.227602\">https://doi.org/10.1145/227595.227602</a>."},"type":"conference","date_published":"1991-01-01T00:00:00Z","status":"public","scopus_import":"1","year":"1991","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-0-89791-439-0"]},"date_created":"2018-12-11T12:09:48Z","publist_id":"86","publication_status":"published","day":"01","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"last_name":"Feder","first_name":"Tomás","full_name":"Feder, Tomás"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"page":"139 - 152","conference":{"location":"Montreal, Canada","end_date":"1991-08-21","start_date":"1991-08-19","name":"PODC: Principles of Distributed Computing"}},{"pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"The complementary DNA of a metabotropic glutamate receptor coupled to inositol phosphate/Ca2+ signal transduction has been cloned and characterized. This receptor shows no sequence similarity to conventional G protein-coupled receptors and has a unique structure with large hydrophilic sequences at both sides of seven putative membrane-spanning domains. Abundant expression of this messenger RNA is observed in neuronal cells in hippocampal dentate gyrus and CA2-3 and in cerebellar Purkinje cells, suggesting the importance of this receptor in specific hippocampal and cerebellar functions."}],"title":"Sequence and expression of a metabotropic glutamate receptor","_id":"2482","intvolume":"       349","citation":{"mla":"Masu, Masayuki, et al. “Sequence and Expression of a Metabotropic Glutamate Receptor.” <i>Nature</i>, vol. 349, no. 6312, Nature Publishing Group, 1991, pp. 760–65, doi:<a href=\"https://doi.org/10.1038/349760a0\">10.1038/349760a0</a>.","ama":"Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. Sequence and expression of a metabotropic glutamate receptor. <i>Nature</i>. 1991;349(6312):760-765. doi:<a href=\"https://doi.org/10.1038/349760a0\">10.1038/349760a0</a>","chicago":"Masu, Masayuki, Yasuto Tanabe, Kunihiro Tsuchida, Ryuichi Shigemoto, and Shigetada Nakanishi. “Sequence and Expression of a Metabotropic Glutamate Receptor.” <i>Nature</i>. Nature Publishing Group, 1991. <a href=\"https://doi.org/10.1038/349760a0\">https://doi.org/10.1038/349760a0</a>.","apa":"Masu, M., Tanabe, Y., Tsuchida, K., Shigemoto, R., &#38; Nakanishi, S. (1991). Sequence and expression of a metabotropic glutamate receptor. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/349760a0\">https://doi.org/10.1038/349760a0</a>","ista":"Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. 1991. Sequence and expression of a metabotropic glutamate receptor. Nature. 349(6312), 760–765.","short":"M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, S. Nakanishi, Nature 349 (1991) 760–765.","ieee":"M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, and S. Nakanishi, “Sequence and expression of a metabotropic glutamate receptor,” <i>Nature</i>, vol. 349, no. 6312. Nature Publishing Group, pp. 760–765, 1991."},"main_file_link":[{"url":"https://www.nature.com/articles/349760a0"}],"status":"public","scopus_import":"1","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"issue":"6312","month":"02","quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1038/349760a0","date_updated":"2022-03-03T15:37:36Z","publisher":"Nature Publishing Group","publication":"Nature","external_id":{"pmid":["1847995 "]},"article_type":"original","oa_version":"None","type":"journal_article","date_published":"1991-02-28T00:00:00Z","volume":349,"year":"1991","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:57:55Z","day":"28","publist_id":"4419","publication_status":"published","author":[{"full_name":"Masu, Masayuki","first_name":"Masayuki","last_name":"Masu"},{"full_name":"Tanabe, Yasuto","first_name":"Yasuto","last_name":"Tanabe"},{"first_name":"Kunihiro","full_name":"Tsuchida, Kunihiro","last_name":"Tsuchida"},{"full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"page":"760 - 765"},{"status":"public","intvolume":"       353","citation":{"mla":"Moriyoshi, Koki, et al. “Molecular Cloning and Characterization of the Rat NMDA Receptor.” <i>Nature</i>, vol. 353, no. 6348, Nature Publishing Group, 1991, pp. 31–37, doi:<a href=\"https://doi.org/10.1038/354031a0\">10.1038/354031a0</a>.","ama":"Moriyoshi K, Masu M, Ishii T, Shigemoto R, Mizuno N, Nakanishi S. Molecular cloning and characterization of the rat NMDA receptor. <i>Nature</i>. 1991;353(6348):31-37. doi:<a href=\"https://doi.org/10.1038/354031a0\">10.1038/354031a0</a>","chicago":"Moriyoshi, Koki, Masayuki Masu, Takahiro Ishii, Ryuichi Shigemoto, Noboru Mizuno, and Shigetada Nakanishi. “Molecular Cloning and Characterization of the Rat NMDA Receptor.” <i>Nature</i>. Nature Publishing Group, 1991. <a href=\"https://doi.org/10.1038/354031a0\">https://doi.org/10.1038/354031a0</a>.","apa":"Moriyoshi, K., Masu, M., Ishii, T., Shigemoto, R., Mizuno, N., &#38; Nakanishi, S. (1991). Molecular cloning and characterization of the rat NMDA receptor. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/354031a0\">https://doi.org/10.1038/354031a0</a>","ista":"Moriyoshi K, Masu M, Ishii T, Shigemoto R, Mizuno N, Nakanishi S. 1991. Molecular cloning and characterization of the rat NMDA receptor. Nature. 353(6348), 31–37.","ieee":"K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, and S. Nakanishi, “Molecular cloning and characterization of the rat NMDA receptor,” <i>Nature</i>, vol. 353, no. 6348. Nature Publishing Group, pp. 31–37, 1991.","short":"K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, S. Nakanishi, Nature 353 (1991) 31–37."},"main_file_link":[{"url":"https://www.nature.com/articles/354031a0"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"A complementary DNA encoding the rat NMDA receptor has been cloned and characterized. The single protein encoded by the cDNA forms a receptor-channel complex that has electrophysiological and pharmacological properties characteristic of the NMDA receptor. This protein has a significant sequence similarity to the AMPA/kainate receptors and contains four putative transmembrane segments following a large extracellular domain. The NMDA receptor messenger RNA is expressed in neuronal cells throughout the brain regions, particularly in the hippocampus, cerebral cortex and cerebellum.","lang":"eng"}],"title":"Molecular cloning and characterization of the rat NMDA receptor","_id":"2483","pmid":1,"issue":"6348","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"scopus_import":"1","date_published":"1991-11-07T00:00:00Z","type":"journal_article","volume":353,"article_type":"original","external_id":{"pmid":["1834949"]},"oa_version":"None","article_processing_charge":"No","publisher":"Nature Publishing Group","date_updated":"2022-03-03T15:25:04Z","doi":"10.1038/354031a0","publication":"Nature","month":"11","quality_controlled":"1","extern":"1","author":[{"last_name":"Moriyoshi","full_name":"Moriyoshi, Koki","first_name":"Koki"},{"last_name":"Masu","first_name":"Masayuki","full_name":"Masu, Masayuki"},{"last_name":"Ishii","full_name":"Ishii, Takahiro","first_name":"Takahiro"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mizuno","first_name":"Noboru","full_name":"Mizuno, Noboru"},{"first_name":"Shigetada","full_name":"Nakanishi, Shigetada","last_name":"Nakanishi"}],"page":"31 - 37","date_created":"2018-12-11T11:57:56Z","day":"07","publist_id":"4418","publication_status":"published","language":[{"iso":"eng"}],"year":"1991"},{"pmid":1,"title":"Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat","_id":"2529","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"The distribution of cerebral cortical neurons sending projection fibers to the nucleus of the solitary tract (NST), and the topographical distribution of axon terminals of cortico-NST fibers within the NST were examined in the cat by two sets of experiments with horseradish peroxidase (HRP) and HRP conjugated with wheat germ agglutinin (WGA-HRP). First, HRP was injected into the NST. In the cerebral cortex of these cats, neuronal cell bodies were labeled retrogradely in the deep pyramidal cell layer (layer V): After HRP injection centered on the rostral or middle part of the NST, HRP-labeled neuronal cell bodies were distributed mainly in the orbital gyrus and caudal part of the intralimbic cortex, and additionally in the rostral part of the anterior sylvian gyrus. After HRP injection centered on the caudal part of the NST, labeled neuronal cell bodies were seen mainly in the caudoventral part of the intralimbic cortex, and additionally in the orbital gyrus, posterior sigmoid gyrus and rostral part of the anterior sylvian gyrus. The labeling in the intralimbic cortex, orbital gyrus and anterior sylvian gyrus was bilateral with a predominantly ipsilateral distribution, while that in the posterior sigmoid gyrus was bilateral with a clear-cut contralateral dominance. In the second set of experiments, WGA-HRP was injected into the cerebral cortical regions where neuronal cell bodies had been retrogradely labeled with HRP injected into the NST: after WGA-HRP injection into the orbital gyrus, presumed axon terminals in the NST were labeled in the rostral two thirds of the nucleus bilaterally with an ipsilateral predominance. After WGA-HRP injection into the rostral part of the anterior sylvian gyrus, a moderate number of presumed axon terminals were labeled throughout the whole rostrocaudal extent of the NST bilaterally with a slight ipsilateral dominance. After WGA-HRP injection into the middle and caudal parts of the anterior sylvian gyrus, no labeling was found in the NST. After WGA-HRP injection into the caudal part of the intralimbic cortex, presumed terminal labeling in the NST was seen throughout the whole rostrocaudal extent of the nucleus bilaterally with a dominant ipsilateral distribution. After WGA-HRP injection into the posterior sigmoid gyrus, however, no terminal labeling was found in the NST. The results indicate that cortico-NST fibers from the orbital gyrus terminate in the rostral two thirds of the NST, while those from the intralimbic cortex and the rostral part of the anterior sylvian gyrus project to the whole rostrocaudal extent of the NST."}],"citation":{"ieee":"Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, and N. Mizuno, “Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat,” <i>Experimental Brain Research</i>, vol. 85, no. 1. Springer, pp. 75–84, 1991.","short":"Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, N. Mizuno, Experimental Brain Research 85 (1991) 75–84.","ista":"Yasui Y, Itoh K, Kaneko T, Shigemoto R, Mizuno N. 1991. Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat. Experimental Brain Research. 85(1), 75–84.","apa":"Yasui, Y., Itoh, K., Kaneko, T., Shigemoto, R., &#38; Mizuno, N. (1991). Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat. <i>Experimental Brain Research</i>. Springer. <a href=\"https://doi.org/10.1007/BF00229988\">https://doi.org/10.1007/BF00229988</a>","chicago":"Yasui, Yukihiko, Kazuo Itoh, Takeshi Kaneko, Ryuichi Shigemoto, and Noboru Mizuno. “Topographical Projections from the Cerebral Cortex to the Nucleus of the Solitary Tract in the Cat.” <i>Experimental Brain Research</i>. Springer, 1991. <a href=\"https://doi.org/10.1007/BF00229988\">https://doi.org/10.1007/BF00229988</a>.","ama":"Yasui Y, Itoh K, Kaneko T, Shigemoto R, Mizuno N. Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat. <i>Experimental Brain Research</i>. 1991;85(1):75-84. doi:<a href=\"https://doi.org/10.1007/BF00229988\">10.1007/BF00229988</a>","mla":"Yasui, Yukihiko, et al. “Topographical Projections from the Cerebral Cortex to the Nucleus of the Solitary Tract in the Cat.” <i>Experimental Brain Research</i>, vol. 85, no. 1, Springer, 1991, pp. 75–84, doi:<a href=\"https://doi.org/10.1007/BF00229988\">10.1007/BF00229988</a>."},"intvolume":"        85","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00229988"}],"status":"public","scopus_import":"1","publication_identifier":{"issn":["0014-4819"],"eissn":["1432-1106"]},"issue":"1","quality_controlled":"1","extern":"1","month":"05","date_updated":"2022-03-03T15:16:05Z","doi":"10.1007/BF00229988","publisher":"Springer","publication":"Experimental Brain Research","article_processing_charge":"No","article_type":"original","oa_version":"None","external_id":{"pmid":["1715827"]},"type":"journal_article","date_published":"1991-05-01T00:00:00Z","volume":85,"language":[{"iso":"eng"}],"year":"1991","day":"01","publist_id":"4370","publication_status":"published","date_created":"2018-12-11T11:58:12Z","page":"75 - 84","author":[{"last_name":"Yasui","first_name":"Yukihiko","full_name":"Yasui, Yukihiko"},{"last_name":"Itoh","first_name":"Kazuo","full_name":"Itoh, Kazuo"},{"first_name":"Takeshi","full_name":"Kaneko, Takeshi","last_name":"Kaneko"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Mizuno","full_name":"Mizuno, Noboru","first_name":"Noboru"}]},{"publication_identifier":{"isbn":["978-0-12-571148-7"]},"scopus_import":"1","status":"public","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/B9780125711463500079"}],"citation":{"mla":"Nakanishi, Shigetada, et al. “Molecular Characterization of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.” <i>Recent Progress in Hormone Research</i>, vol. 46, The Endocrine Society, 1991, pp. 59–83, doi:<a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">10.1016/b978-0-12-571146-3.50007-9</a>.","ama":"Nakanishi S, Ohkubo H, Kakizuka A, et al. Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In: <i>Recent Progress in Hormone Research</i>. Vol 46. The Endocrine Society; 1991:59-83. doi:<a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">10.1016/b978-0-12-571146-3.50007-9</a>","chicago":"Nakanishi, Shigetada, Hiroaki Ohkubo, Akira Kakizuka, Yoshifumi Yokota, Ryuichi Shigemoto, Yoshiki Sasai, and Toru Takumi. “Molecular Characterization of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.” In <i>Recent Progress in Hormone Research</i>, 46:59–83. The Endocrine Society, 1991. <a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">https://doi.org/10.1016/b978-0-12-571146-3.50007-9</a>.","apa":"Nakanishi, S., Ohkubo, H., Kakizuka, A., Yokota, Y., Shigemoto, R., Sasai, Y., &#38; Takumi, T. (1991). Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In <i>Recent Progress in Hormone Research</i> (Vol. 46, pp. 59–83). The Endocrine Society. <a href=\"https://doi.org/10.1016/b978-0-12-571146-3.50007-9\">https://doi.org/10.1016/b978-0-12-571146-3.50007-9</a>","ista":"Nakanishi S, Ohkubo H, Kakizuka A, Yokota Y, Shigemoto R, Sasai Y, Takumi T. 1991.Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel. In: Recent Progress in Hormone Research. vol. 46, 59–83.","ieee":"S. Nakanishi <i>et al.</i>, “Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel,” in <i>Recent Progress in Hormone Research</i>, vol. 46, The Endocrine Society, 1991, pp. 59–83.","short":"S. Nakanishi, H. Ohkubo, A. Kakizuka, Y. Yokota, R. Shigemoto, Y. Sasai, T. Takumi, in:, Recent Progress in Hormone Research, The Endocrine Society, 1991, pp. 59–83."},"intvolume":"        46","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2530","title":"Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel","pmid":1,"author":[{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"},{"first_name":"Hiroaki","full_name":"Ohkubo, Hiroaki","last_name":"Ohkubo"},{"full_name":"Kakizuka, Akira","first_name":"Akira","last_name":"Kakizuka"},{"last_name":"Yokota","full_name":"Yokota, Yoshifumi","first_name":"Yoshifumi"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"first_name":"Yoshiki","full_name":"Sasai, Yoshiki","last_name":"Sasai"},{"full_name":"Takumi, Toru","first_name":"Toru","last_name":"Takumi"}],"page":"59 - 83","date_created":"2018-12-11T11:58:13Z","publist_id":"4369","publication_status":"published","day":"01","year":"1991","language":[{"iso":"eng"}],"volume":46,"type":"book_chapter","date_published":"1991-01-01T00:00:00Z","external_id":{"pmid":["2177908 "]},"oa_version":"None","article_processing_charge":"No","publication":"Recent Progress in Hormone Research","doi":"10.1016/b978-0-12-571146-3.50007-9","date_updated":"2022-03-03T14:59:24Z","publisher":"The Endocrine Society","month":"01","extern":"1","quality_controlled":"1"},{"doi":"10.1113/jphysiol.1990.sp017918","publisher":"Wiley-Blackwell","date_updated":"2022-02-23T16:10:03Z","publication":"Journal of Physiology","article_processing_charge":"No","quality_controlled":"1","oa":1,"extern":"1","month":"01","date_published":"1990-01-01T00:00:00Z","type":"journal_article","volume":420,"external_id":{"pmid":["2324990"]},"article_type":"original","oa_version":"None","language":[{"iso":"eng"}],"year":"1990","page":"365 - 385","author":[{"full_name":"Bräu, Michael","first_name":"Michael","last_name":"Bräu"},{"first_name":"Florian","full_name":"Dreyer, Florian","last_name":"Dreyer"},{"orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"},{"first_name":"Holger","full_name":"Repp, Holger","last_name":"Repp"},{"first_name":"Werner","full_name":"Vogel, Werner","last_name":"Vogel"}],"day":"01","publication_status":"published","publist_id":"2920","date_created":"2018-12-11T12:03:29Z","title":"A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments","_id":"3467","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"The effects of mast cell degranulating peptide (MCDP), a toxin from the honey bee, and of dendrotoxin (DTX), a toxin from the green mamba snake, were studied in voltage-clamped experiments with myelinated nerve fibres of Xenopus. MCDP and DTX blocked part of the K+ current. About 20% of the K+ current, however, was resistant to the toxins even in high concentrations. In Ringer solution half-maximal block was reached with concentrations of 33 nM MCDP and 11 nM DTX. In high-K+ solution the potency of both toxins was lower. β-Bungarotoxin (β-BuTX), another snake toxin, also blocked part of the K+ current, but was less potent than MCDP and DTX. Tail currents in high-K+ solution were analysed and three K+ current components were separated according to Dubois (1981b). Both MCDP and DTX selectively blocked a fast deactivating, slowly inactivating K+ current component which steeply activates between E = -60 mV and E = -40 mV (component f1). In concentrations around 100 nM, MCDP and DTX blocked neither the slow K+ current (component s) nor the fast deactivating, rapidly inactivating K+ current which activates between E = -40 mV and E = 20 mV (component f2). Similar results could be derived from K+ outward currents in Ringer solution. In high-K+, IC50 of MCDP for component f1 was 99 nM, whereas it was 7.6 μM for f2. Corresponding values for DTX are 68 nM and 1.8 μM. Binding studies with nerve fibre membranes of Xenopus reveal high-affinity binding sites for 125I-labelled DTX )K(D) = 22 pM in Ringer solution and 81 pM in high-K+ solution). 125I-labelled DTX can be displaced from its sites completely by unlabelled DTX, toxin I (black mamba toxin), MCDP, and partially by β-BuTX. Immunocytochemical staining demonstrates that binding sites for DTX are present in nodal and paranodal regions of the axonal membrane. The axonal membrane of motor and sensory nerve fibres is equipped with three types of well-characterized K+ channels and constitutes so far the best preparation to study MCDP- and DTX-sensitive K+ channels with electrophysiological and biochemical methods."}],"acknowledgement":"We thank Professor E. Habermann for critical reading of the manuscript and E. Schmidt and J. Schafer for technical assistance. Financial support by the Deutsche Forschungsgemeinschaft (Vo 188/13-1 and SFB 249) is gratefully acknowledged.\r\n","pmid":1,"status":"public","citation":{"chicago":"Bräu, Michael, Florian Dreyer, Peter M Jonas, Holger Repp, and Werner Vogel. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1990. <a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">https://doi.org/10.1113/jphysiol.1990.sp017918</a>.","ama":"Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. <i>Journal of Physiology</i>. 1990;420:365-385. doi:<a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">10.1113/jphysiol.1990.sp017918</a>","mla":"Bräu, Michael, et al. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” <i>Journal of Physiology</i>, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:<a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">10.1113/jphysiol.1990.sp017918</a>.","ieee":"M. Bräu, F. Dreyer, P. M. Jonas, H. Repp, and W. Vogel, “A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments,” <i>Journal of Physiology</i>, vol. 420. Wiley-Blackwell, pp. 365–385, 1990.","short":"M. Bräu, F. Dreyer, P.M. Jonas, H. Repp, W. Vogel, Journal of Physiology 420 (1990) 365–385.","ista":"Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. 1990. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. 420, 365–385.","apa":"Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., &#38; Vogel, W. (1990). A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.1990.sp017918\">https://doi.org/10.1113/jphysiol.1990.sp017918</a>"},"intvolume":"       420","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1190055/","open_access":"1"}],"scopus_import":"1","publication_identifier":{"issn":["0022-3751"],"eissn":["1469-7793"]}},{"month":"01","quality_controlled":"1","extern":"1","acknowledgement":"NSF Grant MCS-83-03926 and DCR-85-05517\r\nAmoco Foundation Faculty Development in Computer Science\r\nNSF Grant DCR-84-01633 and DCR-84-01898","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"We investigate the complexity of determining the shape and presentation (i.e. position with orientation) of convex polytopes in multi-dimensional Euclidean space using a variety of probe models.","lang":"eng"}],"doi":"10.1007/978-1-4613-8997-2_25","publisher":"Springer","date_updated":"2022-02-23T15:41:07Z","title":"Probing convex polytopes","_id":"3565","publication":"Autonomous Robot Vehicles","oa_version":"None","citation":{"chicago":"Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.” In <i>Autonomous Robot Vehicles</i>, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990. <a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">https://doi.org/10.1007/978-1-4613-8997-2_25</a>.","mla":"Dobkin, David, et al. “Probing Convex Polytopes.” <i>Autonomous Robot Vehicles</i>, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:<a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">10.1007/978-1-4613-8997-2_25</a>.","ama":"Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong G, eds. <i>Autonomous Robot Vehicles</i>. Springer; 1990:328-341. doi:<a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">10.1007/978-1-4613-8997-2_25</a>","ieee":"D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in <i>Autonomous Robot Vehicles</i>, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.","short":"D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.","apa":"Dobkin, D., Edelsbrunner, H., &#38; Yap, C. (1990). Probing convex polytopes. In I. Cox &#38; G. Wilfong (Eds.), <i>Autonomous Robot Vehicles</i> (pp. 328–341). Springer. <a href=\"https://doi.org/10.1007/978-1-4613-8997-2_25\">https://doi.org/10.1007/978-1-4613-8997-2_25</a>","ista":"Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341."},"editor":[{"last_name":"Cox","full_name":"Cox, Ingemar","first_name":"Ingemar"},{"first_name":"Gordon","full_name":"Wilfong, Gordon","last_name":"Wilfong"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-1-4613-8997-2_25"}],"type":"book_chapter","date_published":"1990-01-01T00:00:00Z","status":"public","language":[{"iso":"eng"}],"year":"1990","date_created":"2018-12-11T12:03:59Z","publication_identifier":{"isbn":["978-1-4613-8997-2"]},"day":"01","publication_status":"published","publist_id":"2820","author":[{"last_name":"Dobkin","first_name":"David","full_name":"Dobkin, David"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Yap","full_name":"Yap, Chee","first_name":"Chee"}],"page":"328 - 341"},{"title":"Dynamics of polygenic characters under selection","_id":"3649","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Selection on polygenic characters is generally analyzed by statistical methods that assume a Gaussian (normal) distribution of breeding values. We present an alternative analysis based on multilocus population genetics. We use a general representation of selection, recombination, and drift to analyze an idealized polygenic system in which all genetic effects are additive (i.e., both dominance and epistasis are absent), but no assumptions are made about the distribution of breeding values or the numbers of loci or alleles. Our analysis produces three results. First, our equations reproduce the standard recursions for the mean and additive variance if breeding values are Gaussian; but they also reveal how non-Gaussian distributions of breeding values will alter these dynamics. Second, an approximation valid for weak selection shows that even if genetic variance is attributable to an effectively infinite number of loci with only additive effects, selection will generally drive the distribution of breeding values away from a Gaussian distribution by creating multilocus linkage disequilibria. Long-term dynamics of means can depart substantially from the predictions of the standard selection recursions, but the discrepancy may often be negligible for short-term selection. Third, by including mutation, we show that, for realistic parameter values, linkage disequilibrium has little effect on the amount of additive variance maintained at an equilibrium between stabilizing selection and mutation. Each of these analytical results is supported by numerical calculations."}],"acknowledgement":"We thank R. Burger, J. A. Coyne, W. G. Hill, A. A. Hoffmann, J. H. Gillespie, M. Slatkin, T. Nagylaki and Z.-B. Zeng for helpful discussions and comments on earlier drafts. Our research is supported by grants from the National Science Foundation (BSR-8866548), the Science and Engineering Research Council, and the Institute of Theoretical Dynamics at UCD. ","status":"public","citation":{"apa":"Turelli, M., &#38; Barton, N. H. (1990). Dynamics of polygenic characters under selection. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">https://doi.org/10.1016/0040-5809(90)90002-D</a>","ista":"Turelli M, Barton NH. 1990. Dynamics of polygenic characters under selection. Theoretical Population Biology. 38(1), 1–57.","ieee":"M. Turelli and N. H. Barton, “Dynamics of polygenic characters under selection,” <i>Theoretical Population Biology</i>, vol. 38, no. 1. Academic Press, pp. 1–57, 1990.","short":"M. Turelli, N.H. Barton, Theoretical Population Biology 38 (1990) 1–57.","mla":"Turelli, Michael, and Nicholas H. Barton. “Dynamics of Polygenic Characters under Selection.” <i>Theoretical Population Biology</i>, vol. 38, no. 1, Academic Press, 1990, pp. 1–57, doi:<a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">10.1016/0040-5809(90)90002-D</a>.","ama":"Turelli M, Barton NH. Dynamics of polygenic characters under selection. <i>Theoretical Population Biology</i>. 1990;38(1):1-57. doi:<a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">10.1016/0040-5809(90)90002-D</a>","chicago":"Turelli, Michael, and Nicholas H Barton. “Dynamics of Polygenic Characters under Selection.” <i>Theoretical Population Biology</i>. Academic Press, 1990. <a href=\"https://doi.org/10.1016/0040-5809(90)90002-D\">https://doi.org/10.1016/0040-5809(90)90002-D</a>."},"intvolume":"        38","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/004058099090002D?via%3Dihub"}],"scopus_import":"1","issue":"1","publication_identifier":{"issn":["0040-5809"]},"doi":"10.1016/0040-5809(90)90002-D","date_updated":"2022-02-23T14:48:49Z","publisher":"Academic Press","publication":"Theoretical Population Biology","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"01","type":"journal_article","date_published":"1990-01-01T00:00:00Z","volume":38,"article_type":"original","oa_version":"None","year":"1990","language":[{"iso":"eng"}],"page":"1 - 57","author":[{"last_name":"Turelli","first_name":"Michael","full_name":"Turelli, Michael"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"day":"01","publist_id":"2734","publication_status":"published","date_created":"2018-12-11T12:04:26Z"},{"issue":"4","publication_identifier":{"issn":["0016-6731"]},"scopus_import":"1","status":"public","citation":{"ieee":"J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley, “Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones,” <i>Genetics</i>, vol. 124, no. 4. Genetics Society of America, pp. 921–936, 1990.","short":"J. Mallet, N.H. Barton, G. Lamas, J. Santisteban, M. Muedas, H. Eeley, Genetics 124 (1990) 921–936.","ista":"Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. 1990. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. Genetics. 124(4), 921–936.","apa":"Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., &#38; Eeley, H. (1990). Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/124.4.921\">https://doi.org/10.1093/genetics/124.4.921</a>","chicago":"Mallet, James, Nicholas H Barton, Gerado Lamas, José Santisteban, Manuel Muedas, and Harriet Eeley. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” <i>Genetics</i>. Genetics Society of America, 1990. <a href=\"https://doi.org/10.1093/genetics/124.4.921\">https://doi.org/10.1093/genetics/124.4.921</a>.","ama":"Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones. <i>Genetics</i>. 1990;124(4):921-936. doi:<a href=\"https://doi.org/10.1093/genetics/124.4.921\">10.1093/genetics/124.4.921</a>","mla":"Mallet, James, et al. “Estimates of Selection and Gene Flow from Measures of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” <i>Genetics</i>, vol. 124, no. 4, Genetics Society of America, 1990, pp. 921–36, doi:<a href=\"https://doi.org/10.1093/genetics/124.4.921\">10.1093/genetics/124.4.921</a>."},"intvolume":"       124","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203983/"}],"title":"Estimates of selection and gene flow from measures of cline width and linkage disequilibrium in Heliconius hybrid zones","_id":"3650","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Hybrid zones can yield estimates of natural selection and gene flow. The width of a cline in gene frequency is approximately proportional to gene flow (σ) divided by the square root of per-locus selection ( &amp;s). Gene flow also causes gametic correlations (linkage disequilibria) between genes that differ across hybrid zones. Correlations are stronger when the hybrid zone is narrow, and rise to a maximum roughly equal to s. Thus cline width and gametic correlations combine to give estimates of gene flow and selection. These indirect measures of σ and s are especially useful because they can be made from collections, and require no field experiments. The method was applied to hybrid zones between color pattern races in a pair of Peruvian Heliconius butterfly species. The species are Mullerian mimics of one another, and both show the same changes in warning color pattern across their respective hybrid zones. The expectations of cline width and gametic correlation were generated using simulations of clines stabilized by strong frequency-dependent selection. In the hybrid zone in Heliconius erato, clines at three major color pattern loci were between 8.5 and 10.2 km wide, and the pairwise gametic correlations peaked at R &amp; 0.35. These measures suggest that s &amp; 0.23 per locus, and that σ &amp; 2.6 km. In erato, the shapes of the clines agreed with that expected on the basis of dominance. Heliconius melpomene has a nearly coincident hybrid zone. In this species, cline widths at four major color pattern loci varied between 11.7 and 13.4 km. Pairwise gametic correlations peaked near R &amp; 1.00 for tightly linked genes, and at R &amp; 0.40 for unlinked genes, giving s &amp; 0.25 per locus and σ &amp; 3.7 km. In melpomene, cline shapes did not perfectly fit theoretical shapes based on dominance; this deviation might be explained by long-distance migration and/or strong epistasis. Compared with erato, sample sizes in melpomene are lower and the genetics of its color patterns are less well understood. In spite of these problems, selection and gene flow are clearly of the same order of magnitude in the two species. The relatively high per locus selection coefficients agree with ``major gene'' theories for the evolution of Mullerian mimicry, but the genetic architecture of the color patterns does not. These results show that the genetics and evolution of mimicry are still only sketchily understood.","lang":"eng"}],"acknowledgement":"We thank the Natural Environmental Research Council, the Royal Society, the Nuffield Foundation, CONCYTEC, and Mrs. G. W. BORLASE for financial support, and the people of San Martin for their generous hospitality. We are very grateful to S. D. KNAPP, who helped by maintaining our sanity and rearing larvae. We are also grateful to an anonymous reviewer, A. W. PORTER, J. C. SCHNEIDER, M. TURELLI and C. E. WATSON for helpful comments on the manuscript. This paper was approved for publication as journal article no. 5-7255 of the Mississippi Agricultural and Forestry Experiment Station, Mississippi State University, project no. MIS-2 122. ","pmid":1,"page":"921 - 936","author":[{"first_name":"James","full_name":"Mallet, James","last_name":"Mallet"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"full_name":"Lamas, Gerado","first_name":"Gerado","last_name":"Lamas"},{"full_name":"Santisteban, José","first_name":"José","last_name":"Santisteban"},{"first_name":"Manuel","full_name":"Muedas, Manuel","last_name":"Muedas"},{"last_name":"Eeley","first_name":"Harriet","full_name":"Eeley, Harriet"}],"day":"01","publist_id":"2733","publication_status":"published","date_created":"2018-12-11T12:04:26Z","language":[{"iso":"eng"}],"year":"1990","date_published":"1990-04-01T00:00:00Z","type":"journal_article","volume":124,"external_id":{"pmid":["2323556"]},"oa_version":"Published Version","article_type":"original","date_updated":"2022-02-23T11:04:17Z","publisher":"Genetics Society of America","doi":"10.1093/genetics/124.4.921","publication":"Genetics","article_processing_charge":"No","oa":1,"quality_controlled":"1","extern":"1","month":"04"},{"language":[{"iso":"eng"}],"year":"1990","date_created":"2018-12-11T12:04:26Z","day":"01","publist_id":"2732","publication_status":"published","author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"page":"773 - 782","month":"03","quality_controlled":"1","oa":1,"extern":"1","article_processing_charge":"No","date_updated":"2022-02-23T10:41:43Z","doi":"10.1093/genetics/124.3.773 ","publisher":"Genetics Society of America","publication":"Genetics","article_type":"original","external_id":{"pmid":["2311921"]},"oa_version":"Published Version","date_published":"1990-03-01T00:00:00Z","type":"journal_article","volume":124,"scopus_import":"1","publication_identifier":{"issn":["0016-6731"]},"issue":"3","pmid":1,"acknowledgement":"Thanks to JERRY COYNE, BILL HILL, LINDA PARTRIDGE, MICHAEL TURELLI, and two anonymous reviewers for their critical comments. This work was supported by grants from the National Science Foundation (BSR-8866548) the Science and Engineering Research Council (GR/E/08507), and by the Institute of Theoretical Dynamics, University of California, Davis.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"It is widely held that each gene typically affects many characters, and that each character is affected by many genes. Moreover, strong stabilizing selection cannot act on an indefinitely large number of independent traits. This makes it likely that heritable variation in any one trait is maintained as a side effect of polymorphisms which have nothing to do with selection on that trait. This paper examines the idea that variation is maintained as the pleiotropic side effect of either deleterious mutation, or balancing selection. If mutation is responsible, it must produce alleles which are only mildly deleterious (s &amp; 10(-3)), but nevertheless have significant effects on the trait. Balancing selection can readily maintain high heritabilities; however, selection must be spread over many weakly selected polymorphisms if large responses to artificial selection are to be possible. In both classes of pleiotropic model, extreme phenotypes are less fit, giving the appearance of stabilizing selection on the trait. However, it is shown that this effect is weak (of the same order as the selection on each gene): the strong stabilizing selection which is often observed is likely to be caused by correlations with a limited number of directly selected traits. Possible experiments for distinguishing the alternatives are discussed."}],"title":"Pleiotropic models of quantitative variation","_id":"3651","intvolume":"       124","citation":{"chicago":"Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” <i>Genetics</i>. Genetics Society of America, 1990. <a href=\"https://doi.org/10.1093/genetics/124.3.773 \">https://doi.org/10.1093/genetics/124.3.773 </a>.","mla":"Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” <i>Genetics</i>, vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi:<a href=\"https://doi.org/10.1093/genetics/124.3.773 \">10.1093/genetics/124.3.773 </a>.","ama":"Barton NH. Pleiotropic models of quantitative variation. <i>Genetics</i>. 1990;124(3):773-782. doi:<a href=\"https://doi.org/10.1093/genetics/124.3.773 \">10.1093/genetics/124.3.773 </a>","ieee":"N. H. Barton, “Pleiotropic models of quantitative variation,” <i>Genetics</i>, vol. 124, no. 3. Genetics Society of America, pp. 773–782, 1990.","short":"N.H. Barton, Genetics 124 (1990) 773–782.","apa":"Barton, N. H. (1990). Pleiotropic models of quantitative variation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/124.3.773 \">https://doi.org/10.1093/genetics/124.3.773 </a>","ista":"Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3), 773–782."},"main_file_link":[{"open_access":"1","url":"https://academic.oup.com/genetics/article/124/3/773/5999956?login=true"}],"status":"public"},{"publication_identifier":{"eissn":["1095-855X"],"issn":["0747-7171"]},"issue":"3-4","scopus_import":"1","citation":{"chicago":"Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” <i>Journal of Symbolic Computation</i>. Elsevier, 1990. <a href=\"https://doi.org/10.1016/S0747-7171(08)80068-5\">https://doi.org/10.1016/S0747-7171(08)80068-5</a>.","ama":"Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. <i>Journal of Symbolic Computation</i>. 1990;10(3-4):335-347. doi:<a href=\"https://doi.org/10.1016/S0747-7171(08)80068-5\">10.1016/S0747-7171(08)80068-5</a>","mla":"Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” <i>Journal of Symbolic Computation</i>, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:<a href=\"https://doi.org/10.1016/S0747-7171(08)80068-5\">10.1016/S0747-7171(08)80068-5</a>.","short":"H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10 (1990) 335–347.","ieee":"H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” <i>Journal of Symbolic Computation</i>, vol. 10, no. 3–4. Elsevier, pp. 335–347, 1990.","ista":"Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.","apa":"Edelsbrunner, H., Preparata, F., &#38; West, D. (1990). Tetrahedrizing point sets in three dimensions. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0747-7171(08)80068-5\">https://doi.org/10.1016/S0747-7171(08)80068-5</a>"},"intvolume":"        10","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0747717108800685?via%3Dihub"}],"status":"public","acknowledgement":"Research of the first author is supported by Amoco Fnd. Fac. Dec. 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 8504322.","title":"Tetrahedrizing point sets in three dimensions","_id":"4060","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","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 co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.","lang":"eng"}],"day":"01","publication_status":"published","publist_id":"2061","date_created":"2018-12-11T12:06:42Z","page":"335 - 347","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Franco","full_name":"Preparata, Franco","last_name":"Preparata"},{"full_name":"West, Douglas","first_name":"Douglas","last_name":"West"}],"year":"1990","language":[{"iso":"eng"}],"article_type":"original","oa_version":"Published Version","date_published":"1990-01-01T00:00:00Z","type":"journal_article","volume":10,"quality_controlled":"1","oa":1,"extern":"1","month":"01","date_updated":"2022-02-23T10:10:35Z","publisher":"Elsevier","doi":"10.1016/S0747-7171(08)80068-5","publication":"Journal of Symbolic Computation","article_processing_charge":"No"},{"scopus_import":"1","issue":"1","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"_id":"4063","title":"Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms","abstract":[{"text":"This paper describes a general-purpose programming technique, called Simulation of Simplicity, that can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task of providing a consistent treatment for every single special case that can occur. The programs that use the technique tend to be considerably smaller and more robust than those that do not use it. We believe that this technique will become a standard tool in writing geometric software.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Research of both authors was supported by Amoco Foundation Faculty Development grant CS 1-6-44862. It was partially carried out while both authors were with the Institutes for Information Processing at the Technical University of Graz, Austria. The first author also acknowledges support by the National Science Foundation under grant CCR-8714565. ","status":"public","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/77635.77639"}],"citation":{"apa":"Edelsbrunner, H., &#38; Mücke, E. (1990). Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/77635.77639\">https://doi.org/10.1145/77635.77639</a>","ista":"Edelsbrunner H, Mücke E. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 9(1), 66–104.","ieee":"H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms,” <i>ACM Transactions on Graphics</i>, vol. 9, no. 1. ACM, pp. 66–104, 1990.","short":"H. Edelsbrunner, E. Mücke, ACM Transactions on Graphics 9 (1990) 66–104.","mla":"Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” <i>ACM Transactions on Graphics</i>, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi:<a href=\"https://doi.org/10.1145/77635.77639\">10.1145/77635.77639</a>.","ama":"Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. <i>ACM Transactions on Graphics</i>. 1990;9(1):66-104. doi:<a href=\"https://doi.org/10.1145/77635.77639\">10.1145/77635.77639</a>","chicago":"Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” <i>ACM Transactions on Graphics</i>. ACM, 1990. <a href=\"https://doi.org/10.1145/77635.77639\">https://doi.org/10.1145/77635.77639</a>."},"intvolume":"         9","year":"1990","language":[{"iso":"eng"}],"page":"66 - 104","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Mücke","full_name":"Mücke, Ernst","first_name":"Ernst"}],"publication_status":"published","publist_id":"2058","day":"01","date_created":"2018-12-11T12:06:43Z","publication":"ACM Transactions on Graphics","doi":"10.1145/77635.77639","publisher":"ACM","date_updated":"2022-02-22T14:58:39Z","article_processing_charge":"No","extern":"1","quality_controlled":"1","month":"01","volume":9,"date_published":"1990-01-01T00:00:00Z","type":"journal_article","oa_version":"None","article_type":"original"},{"intvolume":"        85","citation":{"short":"H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.","ieee":"H. Edelsbrunner and D. Souvaine, “Computing least median of squares regression lines and guided topological sweep,” <i>Journal of the American Statistical Association</i>, vol. 85, no. 409. American Statistical Association, pp. 115–119, 1990.","apa":"Edelsbrunner, H., &#38; Souvaine, D. (1990). Computing least median of squares regression lines and guided topological sweep. <i>Journal of the American Statistical Association</i>. American Statistical Association. <a href=\"https://doi.org/10.1080/01621459.1990.10475313\">https://doi.org/10.1080/01621459.1990.10475313</a>","ista":"Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 85(409), 115–119.","chicago":"Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” <i>Journal of the American Statistical Association</i>. American Statistical Association, 1990. <a href=\"https://doi.org/10.1080/01621459.1990.10475313\">https://doi.org/10.1080/01621459.1990.10475313</a>.","mla":"Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” <i>Journal of the American Statistical Association</i>, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:<a href=\"https://doi.org/10.1080/01621459.1990.10475313\">10.1080/01621459.1990.10475313</a>.","ama":"Edelsbrunner H, Souvaine D. Computing least median of squares regression lines and guided topological sweep. <i>Journal of the American Statistical Association</i>. 1990;85(409):115-119. doi:<a href=\"https://doi.org/10.1080/01621459.1990.10475313\">10.1080/01621459.1990.10475313</a>"},"main_file_link":[{"url":"https://www.tandfonline.com/doi/abs/10.1080/01621459.1990.10475313"}],"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Given a set of data points pi = (xi, yi ) for 1 ≤ i ≤ n, the least median of squares regression line is a line y = ax + b for which the median of the squared residuals is a minimum over all choices of a and b. An algorithm is described that computes such a line in O(n 2) time and O(n) memory space, thus improving previous upper bounds on the problem. This algorithm is an application of a general method built on top of the topological sweep of line arrangements.","lang":"eng"}],"title":"Computing least median of squares regression lines and guided topological sweep","_id":"4064","publication_identifier":{"issn":["0003-1291"],"eissn":["1537-274X"]},"issue":"409","scopus_import":"1","oa_version":"None","article_type":"original","type":"journal_article","date_published":"1990-01-01T00:00:00Z","volume":85,"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-02-22T15:10:54Z","doi":"10.1080/01621459.1990.10475313","publisher":"American Statistical Association","publication":"Journal of the American Statistical Association","date_created":"2018-12-11T12:06:43Z","day":"01","publist_id":"2059","publication_status":"published","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Souvaine, Diane","first_name":"Diane","last_name":"Souvaine"}],"page":"115 - 119","language":[{"iso":"eng"}],"year":"1990"},{"issue":"2","publication_identifier":{"eissn":["1872-681X"],"issn":["0012-365X"]},"scopus_import":"1","status":"public","citation":{"chicago":"Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.” <i>Discrete Mathematics</i>. Elsevier, 1990. <a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">https://doi.org/10.1016/0012-365X(90)90147-A</a>.","ama":"Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. <i>Discrete Mathematics</i>. 1990;81(2):153-164. doi:<a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">10.1016/0012-365X(90)90147-A</a>","mla":"Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” <i>Discrete Mathematics</i>, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:<a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">10.1016/0012-365X(90)90147-A</a>.","short":"H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.","ieee":"H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” <i>Discrete Mathematics</i>, vol. 81, no. 2. Elsevier, pp. 153–164, 1990.","ista":"Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.","apa":"Edelsbrunner, H., Robison, A., &#38; Shen, X. (1990). Covering convex sets with non-overlapping polygons. <i>Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">https://doi.org/10.1016/0012-365X(90)90147-A</a>"},"intvolume":"        81","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0012365X9090147A?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"We prove that given n⩾3 convex, compact, and pairwise disjoint sets in the plane, they may be covered with n non-overlapping convex polygons with a total of not more than 6n−9 sides, and with not more than 3n−6 distinct slopes. Furthermore, we construct sets that require 6n−9 sides and 3n−6 slopes for n⩾3. The upper bound on the number of slopes implies a new bound on a recently studied transversal problem.","lang":"eng"}],"title":"Covering convex sets with non-overlapping polygons","_id":"4065","acknowledgement":"The first author acknowledges the support by Amoco Fnd. Fat. Dev. Comput. Sci. l-6-44862. Work on this paper by the second author was supported by a Shell Fellowship in Computer Science. The third author as supported by the office of Naval Research under grant NOOO14-86K-0416. ","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Robison, Arch","first_name":"Arch","last_name":"Robison"},{"last_name":"Shen","first_name":"Xiao","full_name":"Shen, Xiao"}],"page":"153 - 164","date_created":"2018-12-11T12:06:44Z","day":"15","publist_id":"2060","publication_status":"published","language":[{"iso":"eng"}],"year":"1990","type":"journal_article","date_published":"1990-04-15T00:00:00Z","volume":81,"article_type":"original","oa_version":"None","article_processing_charge":"No","doi":"10.1016/0012-365X(90)90147-A","date_updated":"2022-02-22T15:45:55Z","publisher":"Elsevier","publication":"Discrete Mathematics","month":"04","quality_controlled":"1","extern":"1"},{"_id":"4066","title":"The complexity of many cells in arrangements of planes and related problems","abstract":[{"text":"We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m 2/3 n logn +n 2); we can calculatem such cells specified by a point in each, in worst-case timeO(m 2/3 n log3 n+n 2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m 2/3 n logn+n 2), but this number is onlyO(m 3/5– n 4/5+2 +m+n logm), for any&gt;0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m 3/4– n 3/4+3 +m) log2 n+n logn logm) for any&gt;0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m 3/4– n 3/4+3 +m] log2 n+n logn logm) for any&gt;0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d&gt;3, isO(m 2/3 n d/3 logn+n d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. I-6-44862 and by NSF Grant CCR-87t4565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD--the Israeli National Council for Research and Development. An abstract of this\r\npaper has appeared in the Proceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187785"}],"intvolume":"         5","citation":{"short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 5 (1990) 197–216.","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1. Springer, pp. 197–216, 1990.","apa":"Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187785\">https://doi.org/10.1007/BF02187785</a>","ista":"Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete &#38; Computational Geometry. 5(1), 197–216.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02187785\">https://doi.org/10.1007/BF02187785</a>.","mla":"Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:<a href=\"https://doi.org/10.1007/BF02187785\">10.1007/BF02187785</a>.","ama":"Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. <i>Discrete &#38; Computational Geometry</i>. 1990;5(1):197-216. doi:<a href=\"https://doi.org/10.1007/BF02187785\">10.1007/BF02187785</a>"},"scopus_import":"1","issue":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"publication":"Discrete & Computational Geometry","date_updated":"2022-02-22T11:02:41Z","doi":"10.1007/BF02187785","publisher":"Springer","article_processing_charge":"No","extern":"1","quality_controlled":"1","month":"03","volume":5,"type":"journal_article","date_published":"1990-03-01T00:00:00Z","article_type":"original","oa_version":"None","language":[{"iso":"eng"}],"year":"1990","page":"197 - 216","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"first_name":"Leonidas","full_name":"Guibas, Leonidas","last_name":"Guibas"},{"last_name":"Sharir","full_name":"Sharir, Micha","first_name":"Micha"}],"publication_status":"published","publist_id":"2054","day":"01","date_created":"2018-12-11T12:06:44Z"},{"acknowledgement":"Research of the first author was supported by the National Science Foundation under grant CCR-8714565. Work of the second author was supported by Office of Naval Research Grants DCR-83-20085 and CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD — the Israeli National Council for Research and Development, and the Fund for Basic Research in Electronics, Computers and Communication administered by the Israeli Academy of Sciences.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"This paper proves an O(m 2/3 n 2/3+m+n) upper bound on the number of incidences between m points and n hyperplanes in four dimensions, assuming all points lie on one side of each hyperplane and the points and hyperplanes satisfy certain natural general position conditions. This result has application to various three-dimensional combinatorial distance problems. For example, it implies the same upper bound for the number of bichromatic minimum distance pairs in a set of m blue and n red points in three-dimensional space. This improves the best previous bound for this problem."}],"title":"A hyperplane Incidence problem with applications to counting distances","_id":"4067","intvolume":"       450","citation":{"chicago":"Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” In <i>Proceedings of the International Symposium on Algorithms</i>, 450:419–28. Springer, 1990. <a href=\"https://doi.org/10.1007/3-540-52921-7_91\">https://doi.org/10.1007/3-540-52921-7_91</a>.","mla":"Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” <i>Proceedings of the International Symposium on Algorithms</i>, vol. 450, Springer, 1990, pp. 419–28, doi:<a href=\"https://doi.org/10.1007/3-540-52921-7_91\">10.1007/3-540-52921-7_91</a>.","ama":"Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: <i>Proceedings of the International Symposium on Algorithms</i>. Vol 450. Springer; 1990:419-428. doi:<a href=\"https://doi.org/10.1007/3-540-52921-7_91\">10.1007/3-540-52921-7_91</a>","ieee":"H. Edelsbrunner and M. Sharir, “A hyperplane Incidence problem with applications to counting distances,” in <i>Proceedings of the International Symposium on Algorithms</i>, Tokyo, Japan, 1990, vol. 450, pp. 419–428.","short":"H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.","apa":"Edelsbrunner, H., &#38; Sharir, M. (1990). A hyperplane Incidence problem with applications to counting distances. In <i>Proceedings of the International Symposium on Algorithms</i> (Vol. 450, pp. 419–428). Tokyo, Japan: Springer. <a href=\"https://doi.org/10.1007/3-540-52921-7_91\">https://doi.org/10.1007/3-540-52921-7_91</a>","ista":"Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. Proceedings of the International Symposium on Algorithms. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450, 419–428."},"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-52921-7_91"}],"status":"public","scopus_import":"1","publication_identifier":{"isbn":["978-3-540-52921-7"]},"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-02-22T14:31:26Z","publisher":"Springer","doi":"10.1007/3-540-52921-7_91","publication":"Proceedings of the International Symposium on Algorithms","oa_version":"None","type":"conference","date_published":"1990-01-01T00:00:00Z","volume":450,"year":"1990","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:06:45Z","day":"01","publication_status":"published","publist_id":"2056","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"conference":{"location":"Tokyo, Japan","end_date":"1990-08-18","start_date":"1990-08-16","name":"SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  "},"page":"419 - 428","alternative_title":["LNCS"]},{"publication":"Discrete & Computational Geometry","doi":"10.1007/BF02187778","date_updated":"2022-02-22T14:50:34Z","publisher":"Springer","article_processing_charge":"No","extern":"1","quality_controlled":"1","month":"01","volume":5,"type":"journal_article","date_published":"1990-01-01T00:00:00Z","oa_version":"None","article_type":"original","language":[{"iso":"eng"}],"year":"1990","page":"35 - 42","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"publication_status":"published","publist_id":"2057","day":"01","date_created":"2018-12-11T12:06:45Z","_id":"4068","title":"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2","abstract":[{"lang":"eng","text":"LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations\r\n(i1i2in−1in)(inin−1i2i1) \r\nis called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Research of the first author was supported by Amoco Foundation for Faculty Development in Computer Science Grant No. 1-6-44862. Work on this paper by the second author was supported by Office of Naval Research Grant No. N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation.","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187778"}],"citation":{"apa":"Edelsbrunner, H., &#38; Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187778\">https://doi.org/10.1007/BF02187778</a>","ista":"Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete &#38; Computational Geometry. 5(1), 35–42.","short":"H. Edelsbrunner, M. Sharir, Discrete &#38; Computational Geometry 5 (1990) 35–42.","ieee":"H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1. Springer, pp. 35–42, 1990.","mla":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” <i>Discrete &#38; Computational Geometry</i>, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:<a href=\"https://doi.org/10.1007/BF02187778\">10.1007/BF02187778</a>.","ama":"Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. <i>Discrete &#38; Computational Geometry</i>. 1990;5(1):35-42. doi:<a href=\"https://doi.org/10.1007/BF02187778\">10.1007/BF02187778</a>","chicago":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02187778\">https://doi.org/10.1007/BF02187778</a>."},"intvolume":"         5","issue":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]}},{"scopus_import":"1","issue":"3","publication_identifier":{"issn":["0209-9683"],"eissn":["1439-6912"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry."}],"title":"An acyclicity theorem for cell complexes in d dimension","_id":"4069","acknowledgement":"Research reported in this paper was supported by the National Science Foundation under grant CCR-8714565.","status":"public","intvolume":"        10","citation":{"chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Combinatorica</i>. Springer, 1990. <a href=\"https://doi.org/10.1007/BF02122779\">https://doi.org/10.1007/BF02122779</a>.","mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Combinatorica</i>, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:<a href=\"https://doi.org/10.1007/BF02122779\">10.1007/BF02122779</a>.","ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. <i>Combinatorica</i>. 1990;10(3):251-260. doi:<a href=\"https://doi.org/10.1007/BF02122779\">10.1007/BF02122779</a>","short":"H. Edelsbrunner, Combinatorica 10 (1990) 251–260.","ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” <i>Combinatorica</i>, vol. 10, no. 3. Springer, pp. 251–260, 1990.","apa":"Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/BF02122779\">https://doi.org/10.1007/BF02122779</a>","ista":"Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260."},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02122779"}],"language":[{"iso":"eng"}],"year":"1990","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"page":"251 - 260","date_created":"2018-12-11T12:06:45Z","day":"01","publication_status":"published","publist_id":"2050","article_processing_charge":"No","date_updated":"2022-02-21T11:08:30Z","publisher":"Springer","doi":"10.1007/BF02122779","publication":"Combinatorica","month":"09","quality_controlled":"1","extern":"1","date_published":"1990-09-01T00:00:00Z","type":"journal_article","volume":10,"article_type":"original","oa_version":"None"},{"month":"01","extern":"1","quality_controlled":"1","article_processing_charge":"No","publication":"International Journal of Computer Mathematics","publisher":"Taylor & Francis","date_updated":"2022-02-21T13:19:52Z","doi":"10.1080/00207169008803871","oa_version":"None","volume":34,"type":"journal_article","date_published":"1990-01-01T00:00:00Z","year":"1990","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:06:46Z","publist_id":"2051","publication_status":"published","day":"01","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mark","full_name":"Overmars, Mark","last_name":"Overmars"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"},{"full_name":"Hartman, Irith","first_name":"Irith","last_name":"Hartman"},{"full_name":"Feldman, Jack","first_name":"Jack","last_name":"Feldman"}],"page":"129 - 144","abstract":[{"text":"Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point p∊s∩t so that p∉u for all u with p(s)<p(u)<p(t). It is shown that a ranking can be found in time O(n log n) such that each interval sees at most three other intervals. It is also shown that a ranking that minimizes the average number of endpoints visible from an interval can be computed in time O(n 5/2). The results have applications to intersection problems for intervals, as well as to channel routing problems which arise in layouts of VLSI circuits.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4070","title":"Ranking intervals under visibility constraints","main_file_link":[{"url":"https://www.tandfonline.com/doi/abs/10.1080/00207169008803871"}],"citation":{"ieee":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” <i>International Journal of Computer Mathematics</i>, vol. 34, no. 3–4. Taylor &#38; Francis, pp. 129–144, 1990.","short":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.","apa":"Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., &#38; Feldman, J. (1990). Ranking intervals under visibility constraints. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207169008803871\">https://doi.org/10.1080/00207169008803871</a>","ista":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.","chicago":"Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1990. <a href=\"https://doi.org/10.1080/00207169008803871\">https://doi.org/10.1080/00207169008803871</a>.","mla":"Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” <i>International Journal of Computer Mathematics</i>, vol. 34, no. 3–4, Taylor &#38; Francis, 1990, pp. 129–44, doi:<a href=\"https://doi.org/10.1080/00207169008803871\">10.1080/00207169008803871</a>.","ama":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. <i>International Journal of Computer Mathematics</i>. 1990;34(3-4):129-144. doi:<a href=\"https://doi.org/10.1080/00207169008803871\">10.1080/00207169008803871</a>"},"intvolume":"        34","status":"public","scopus_import":"1","publication_identifier":{"eissn":["1029-0265"],"issn":["0020-7160"]},"issue":"3-4"},{"publication_status":"published","publist_id":"2052","day":"01","publication_identifier":{"isbn":["978-0-89791-362-1"]},"date_created":"2018-12-11T12:06:46Z","page":"44 - 52","conference":{"location":"Berkley, CA, United States","end_date":"1990-06-09","start_date":"1990-06-07","name":"SCG: Symposium on Computational Geometry"},"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Tiow","full_name":"Tan, Tiow","last_name":"Tan"},{"last_name":"Waupotitsch","full_name":"Waupotitsch, Roman","first_name":"Roman"}],"year":"1990","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/98524.98535"}],"citation":{"chicago":"Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” In <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, 44–52. ACM, 1990. <a href=\"https://doi.org/10.1145/98524.98535\">https://doi.org/10.1145/98524.98535</a>.","mla":"Edelsbrunner, Herbert, et al. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.” <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>, ACM, 1990, pp. 44–52, doi:<a href=\"https://doi.org/10.1145/98524.98535\">10.1145/98524.98535</a>.","ama":"Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: <i>Proceedings of the 6th Annual Symposium on Computational Geometry</i>. ACM; 1990:44-52. doi:<a href=\"https://doi.org/10.1145/98524.98535\">10.1145/98524.98535</a>","short":"H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.","ieee":"H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in <i>Proceedings of the 6th annual symposium on Computational geometry</i>, Berkley, CA, United States, 1990, pp. 44–52.","apa":"Edelsbrunner, H., Tan, T., &#38; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In <i>Proceedings of the 6th annual symposium on Computational geometry</i> (pp. 44–52). Berkley, CA, United States: ACM. <a href=\"https://doi.org/10.1145/98524.98535\">https://doi.org/10.1145/98524.98535</a>","ista":"Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52."},"oa_version":"None","status":"public","type":"conference","date_published":"1990-01-01T00:00:00Z","extern":"1","quality_controlled":"1","month":"01","publication":"Proceedings of the 6th annual symposium on Computational geometry","_id":"4071","publisher":"ACM","doi":"10.1145/98524.98535","title":"An O(n^2log n) time algorithm for the MinMax angle triangulation","date_updated":"2022-02-22T08:56:42Z","abstract":[{"lang":"eng","text":"We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement."}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"}]