[{"publisher":"Elsevier","corr_author":"1","day":"05","_id":"2304","scopus_import":1,"language":[{"iso":"eng"}],"citation":{"apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. <i>Electronic Notes in Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">https://doi.org/10.1016/j.endm.2013.07.008</a>","chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” <i>Electronic Notes in Discrete Mathematics</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">https://doi.org/10.1016/j.endm.2013.07.008</a>.","ama":"Pausinger F. Van der Corput sequences and linear permutations. <i>Electronic Notes in Discrete Mathematics</i>. 2013;43:43-50. doi:<a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">10.1016/j.endm.2013.07.008</a>","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43. Elsevier, pp. 43–50, 2013.","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43, Elsevier, 2013, pp. 43–50, doi:<a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">10.1016/j.endm.2013.07.008</a>."},"page":"43 - 50","publication":"Electronic Notes in Discrete Mathematics","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","title":"Van der Corput sequences and linear permutations","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4623","volume":43,"type":"journal_article","quality_controlled":"1","oa_version":"None","publication_status":"published","abstract":[{"text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.","lang":"eng"}],"date_created":"2018-12-11T11:56:53Z","intvolume":"        43","doi":"10.1016/j.endm.2013.07.008","status":"public","year":"2013","department":[{"_id":"HeEd"}],"date_published":"2013-09-05T00:00:00Z","date_updated":"2024-10-09T20:55:15Z","author":[{"last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}]},{"author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","last_name":"Pausinger"}],"date_published":"2013-02-21T00:00:00Z","date_updated":"2026-04-16T10:09:03Z","year":"2013","department":[{"_id":"HeEd"}],"alternative_title":["LNCS"],"status":"public","abstract":[{"lang":"eng","text":"Mathematical objects can be measured unambiguously, but not so objects from our physical world. Even the total length of tubelike shapes has its difficulties. We introduce a combination of geometric, probabilistic, and topological methods to design a stable length estimate for tube-like shapes; that is: one that is insensitive to small shape changes."}],"date_created":"2018-12-11T11:59:53Z","intvolume":"      7749","publication_status":"published","doi":"10.1007/978-3-642-37067-0","type":"conference","quality_controlled":"1","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","publist_id":"3952","volume":7749,"conference":{"end_date":"2013-03-22","location":"Seville, Spain","start_date":"2013-03-20","name":"DGCI: Discrete Geometry for Computer Imagery"},"title":"Stable length estimates of tube-like shapes","related_material":{"record":[{"status":"public","relation":"later_version","id":"2255"}]},"publication":"17th IAPR International Conference on Discrete Geometry for Computer Imagery","page":"XV - XIX","citation":{"ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. In: <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>. Vol 7749. Springer; 2013:XV-XIX. doi:<a href=\"https://doi.org/10.1007/978-3-642-37067-0\">10.1007/978-3-642-37067-0</a>","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” In <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>, 7749:XV–XIX. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37067-0\">https://doi.org/10.1007/978-3-642-37067-0</a>.","apa":"Edelsbrunner, H., &#38; Pausinger, F. (2013). Stable length estimates of tube-like shapes. In <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i> (Vol. 7749, pp. XV–XIX). Seville, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-37067-0\">https://doi.org/10.1007/978-3-642-37067-0</a>","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>, vol. 7749, Springer, 2013, pp. XV–XIX, doi:<a href=\"https://doi.org/10.1007/978-3-642-37067-0\">10.1007/978-3-642-37067-0</a>.","short":"H. Edelsbrunner, F. Pausinger, in:, 17th IAPR International Conference on Discrete Geometry for Computer Imagery, Springer, 2013, pp. XV–XIX.","ista":"Edelsbrunner H, Pausinger F. 2013. Stable length estimates of tube-like shapes. 17th IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: Discrete Geometry for Computer Imagery, LNCS, vol. 7749, XV–XIX.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” in <i>17th IAPR International Conference on Discrete Geometry for Computer Imagery</i>, Seville, Spain, 2013, vol. 7749, pp. XV–XIX."},"language":[{"iso":"eng"}],"_id":"2843","scopus_import":1,"publisher":"Springer","day":"21"},{"publication":"Russian Mathematical Surveys","title":"On the configuration space of Steiner minimal trees","publist_id":"3943","volume":67,"day":"01","publisher":"IOP Publishing","_id":"2849","ddc":["000"],"issue":"6","year":"2012","date_published":"2012-01-01T00:00:00Z","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:59:55Z","intvolume":"        67","external_id":{"isi":["000315950100005"]},"page":"1167 - 1168","file":[{"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:14:26Z","access_level":"open_access","file_id":"5078","file_size":392021,"checksum":"44ee8d173487e8ed41a51136816bbeb4","relation":"main_file","date_updated":"2020-07-14T12:45:51Z","file_name":"IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf"}],"month":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:45:51Z","scopus_import":"1","pubrep_id":"546","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. IOP Publishing, pp. 1167–1168, 2012.","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, IOP Publishing, 2012, pp. 1167–68, doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>.","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. IOP Publishing. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>. IOP Publishing, 2012. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>.","ama":"Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167-1168. doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>"},"department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T08:19:37Z","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nataliya","full_name":"Strelkova, Nataliya","last_name":"Strelkova"}],"article_processing_charge":"No","oa_version":"Submitted Version","type":"journal_article","doi":"10.1070/RM2012v067n06ABEH004820","publication_status":"published","status":"public","isi":1},{"publication":"Modeling and Analysis of Information Systems","page":"152 - 160","title":"Fractal and computational geometry for generalizing cartographic objects","article_type":"original","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":19,"publist_id":"3845","publisher":"Russian Academy of Sciences","day":"01","_id":"2902","language":[{"iso":"rus"}],"citation":{"mla":"Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.","ista":"Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.","ieee":"H. Edelsbrunner <i>et al.</i>, “Fractal and computational geometry for generalizing cartographic objects,” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.","short":"H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.","chicago":"Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences, 2012.","apa":"Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences.","ama":"Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. 2012;19(6):152-160."},"year":"2012","issue":"6","department":[{"_id":"HeEd"}],"date_published":"2012-12-01T00:00:00Z","date_updated":"2023-10-18T07:34:45Z","oa":1,"article_processing_charge":"No","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Musin, Oleg","last_name":"Musin","first_name":"Oleg"},{"full_name":"Ukhalov, Alexey","last_name":"Ukhalov","first_name":"Alexey"},{"last_name":"Yakimova","full_name":"Yakimova, Olga","first_name":"Olga"},{"first_name":"Vladislav","full_name":"Alexeev, Vladislav","last_name":"Alexeev"},{"full_name":"Bogaevskaya, Victoriya","last_name":"Bogaevskaya","first_name":"Victoriya"},{"first_name":"Andrey","full_name":"Gorohov, Andrey","last_name":"Gorohov"},{"full_name":"Preobrazhenskaya, Margarita","last_name":"Preobrazhenskaya","first_name":"Margarita"}],"type":"journal_article","quality_controlled":"1","oa_version":"Published Version","date_created":"2018-12-11T12:00:15Z","publication_status":"published","intvolume":"        19","abstract":[{"text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. ","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://mi.mathnet.ru/eng/mais280"}],"status":"public"},{"title":"The adaptive topology of a digital image","publist_id":"3844","day":"06","publisher":"IEEE","_id":"2903","ddc":["000"],"year":"2012","date_published":"2012-08-06T00:00:00Z","oa":1,"quality_controlled":"1","date_created":"2018-12-11T12:00:15Z","abstract":[{"text":"In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images.","lang":"eng"}],"page":"41 - 48","file":[{"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:09:41Z","access_level":"open_access","file_id":"4765","file_size":760548,"checksum":"444869a4e8abf07834f88b6e5cb5e9c3","relation":"main_file","file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","date_updated":"2020-07-14T12:45:52Z"}],"conference":{"name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering","start_date":"2012-06-27","location":"New Brunswick, NJ, USA ","end_date":"2012-06-29"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"08","file_date_updated":"2020-07-14T12:45:52Z","corr_author":"1","scopus_import":1,"pubrep_id":"545","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"ieee":"H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.","short":"H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.","ista":"Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.","mla":"Edelsbrunner, Herbert, and Olga Symonova. <i>The Adaptive Topology of a Digital Image</i>. IEEE, 2012, pp. 41–48, doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>.","apa":"Edelsbrunner, H., &#38; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>","chicago":"Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>.","ama":"Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In: IEEE; 2012:41-48. doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>"},"department":[{"_id":"HeEd"},{"_id":"MaJö"}],"date_updated":"2024-10-09T20:54:57Z","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2012-9947","first_name":"Olga","last_name":"Symonova","full_name":"Symonova, Olga"}],"oa_version":"Submitted Version","type":"conference","doi":"10.1109/ISVD.2012.11","publication_status":"published","status":"public"},{"scopus_import":"1","file_date_updated":"2020-07-14T12:45:52Z","has_accepted_license":"1","citation":{"ama":"Pausinger F. Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie des Nombres des Bordeaux</i>. 2012;24(3):729-749. doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>","apa":"Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>","chicago":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux, 2012. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>.","short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","ieee":"F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” <i>Journal de Theorie des Nombres des Bordeaux</i>, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749.","mla":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>."},"language":[{"iso":"eng"}],"external_id":{"isi":["000315243100011"]},"page":"729 - 749","file":[{"creator":"dernst","content_type":"application/pdf","access_level":"open_access","date_created":"2020-05-11T12:40:39Z","file_id":"7819","file_size":819275,"relation":"main_file","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","file_name":"JTNB_2012__24_3_729_0.pdf","date_updated":"2020-07-14T12:45:52Z"}],"publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"month":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.5802/jtnb.819","publication_status":"published","oa_version":"Published Version","type":"journal_article","isi":1,"status":"public","date_updated":"2025-09-30T08:18:15Z","department":[{"_id":"HeEd"}],"author":[{"full_name":"Pausinger, Florian","last_name":"Pausinger","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"article_processing_charge":"No","_id":"2904","day":"01","publisher":"Université de Bordeaux","ddc":["510"],"publication":"Journal de Theorie des Nombres des Bordeaux","volume":24,"publist_id":"3843","title":"Weak multipliers for generalized van der Corput sequences","article_type":"original","abstract":[{"text":"Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences.","lang":"eng"},{"text":"Les suites de Van der Corput généralisées sont dessuites unidimensionnelles et infinies dans l’intervalle de l’unité.Elles sont générées par permutations des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de distribution uniforme des suites de Halton nous nousintéressons aux permutations de la formuleP(i)  =ai(modb)pour les entiers premiers entre euxaetb. Dans cet article nousidentifions des multiplicateursagénérant des suites de Van derCorput ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée.","lang":"fre"}],"date_created":"2018-12-11T12:00:15Z","intvolume":"        24","quality_controlled":"1","date_published":"2012-01-01T00:00:00Z","issue":"3","year":"2012","oa":1},{"page":"1167–1168","publication":"Russian Mathematical Surveys","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":67,"publist_id":"3831","title":"On the configuration space for the shortest networks","_id":"2912","publisher":"Russian Academy of Sciences","day":"01","citation":{"ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>.","ama":"Edelsbrunner H, Strelkova N. On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167–1168. doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences, 2012. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>."},"language":[{"iso":"eng"}],"date_published":"2012-10-01T00:00:00Z","date_updated":"2023-10-17T11:40:39Z","year":"2012","department":[{"_id":"HeEd"}],"issue":"6","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Strelkova, Nataliya","last_name":"Strelkova","first_name":"Nataliya"}],"article_processing_charge":"No","intvolume":"        67","date_created":"2018-12-11T12:00:18Z","publication_status":"published","doi":"10.4213/rm9503","quality_controlled":"1","type":"journal_article","oa_version":"None","status":"public"},{"pubrep_id":"132","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"ista":"Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.","ieee":"N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.","short":"N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.","mla":"Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>.","apa":"Dolbilin, N., Edelsbrunner, H., &#38; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. IOP Publishing. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>","chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>. IOP Publishing, 2012. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>.","ama":"Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. 2012;67(4):781-783. doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>"},"file_date_updated":"2020-07-14T12:45:55Z","scopus_import":"1","month":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000310789000005"]},"file":[{"file_id":"5239","access_level":"open_access","date_created":"2018-12-12T10:16:49Z","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:55Z","file_name":"IST-2013-132-v1+1_2012-J-04-Functional-E.pdf","relation":"main_file","checksum":"389a5ae53d6347de36c3468034f2821d","file_size":253816}],"page":"781 - 783","status":"public","isi":1,"oa_version":"Submitted Version","type":"journal_article","doi":"10.1070/RM2012v067n04ABEH004807","publication_status":"published","author":[{"first_name":"Nikolai","last_name":"Dolbilin","full_name":"Dolbilin, Nikolai"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Oleg","full_name":"Musin, Oleg","last_name":"Musin"}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T08:13:48Z","ddc":["510"],"day":"01","publisher":"IOP Publishing","_id":"2941","title":"On the optimality of functionals over triangulations of Delaunay sets","publist_id":"3792","volume":67,"publication":"Russian Mathematical Surveys","quality_controlled":"1","intvolume":"        67","date_created":"2018-12-11T12:00:28Z","oa":1,"issue":"4","year":"2012","date_published":"2012-11-01T00:00:00Z"},{"alternative_title":["LNCS"],"year":"2012","date_published":"2012-08-01T00:00:00Z","quality_controlled":"1","intvolume":"      7476","abstract":[{"text":"We study the task of interactive semantic labeling of a segmentation hierarchy. To this end we propose a framework interleaving two components: an automatic labeling step, based on a Conditional Random Field whose dependencies are defined by the inclusion tree of the segmentation hierarchy, and an interaction step that integrates incremental input from a human user. Evaluated on two distinct datasets, the proposed interactive approach efficiently integrates human interventions and illustrates the advantages of structured prediction in an interactive framework. ","lang":"eng"}],"date_created":"2018-12-11T12:00:37Z","publication":"34th DAGM and 36th OAGM Symposium","title":"Interactive labeling of image segmentation hierarchies","volume":7476,"publist_id":"3737","day":"01","publisher":"Springer","_id":"2971","department":[{"_id":"HeEd"}],"date_updated":"2025-05-20T07:21:42Z","author":[{"first_name":"Georg","last_name":"Zankl","full_name":"Zankl, Georg"},{"first_name":"Yll","full_name":"Haxhimusa, Yll","last_name":"Haxhimusa"},{"first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87","full_name":"Ion, Adrian","last_name":"Ion"}],"article_processing_charge":"No","oa_version":"None","type":"conference","doi":"10.1007/978-3-642-32717-9_2","publication_status":"published","status":"public","publication_identifier":{"eisbn":["9783642327179"],"eissn":["1611-3349"]},"OA_type":"closed access","page":"11 - 20","conference":{"location":"Graz, Austria","start_date":"2012-08-28","name":"Pattern Recognition","end_date":"2012-08-31"},"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"ama":"Zankl G, Haxhimusa Y, Ion A. Interactive labeling of image segmentation hierarchies. In: <i>34th DAGM and 36th OAGM Symposium</i>. Vol 7476. Springer; 2012:11-20. doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>","apa":"Zankl, G., Haxhimusa, Y., &#38; Ion, A. (2012). Interactive labeling of image segmentation hierarchies. In <i>34th DAGM and 36th OAGM Symposium</i> (Vol. 7476, pp. 11–20). Graz, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>","chicago":"Zankl, Georg, Yll Haxhimusa, and Adrian Ion. “Interactive Labeling of Image Segmentation Hierarchies.” In <i>34th DAGM and 36th OAGM Symposium</i>, 7476:11–20. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>.","ieee":"G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” in <i>34th DAGM and 36th OAGM Symposium</i>, Graz, Austria, 2012, vol. 7476, pp. 11–20.","ista":"Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. 34th DAGM and 36th OAGM Symposium. Pattern Recognition, LNCS, vol. 7476, 11–20.","short":"G. Zankl, Y. Haxhimusa, A. Ion, in:, 34th DAGM and 36th OAGM Symposium, Springer, 2012, pp. 11–20.","mla":"Zankl, Georg, et al. “Interactive Labeling of Image Segmentation Hierarchies.” <i>34th DAGM and 36th OAGM Symposium</i>, vol. 7476, Springer, 2012, pp. 11–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>."}},{"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1109.2158","open_access":"1"}],"date_created":"2018-12-11T12:01:28Z","abstract":[{"text":"We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter δ its running time additionally depends on δ. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution P with at most one more vertex than a vertex-minimal one.","lang":"eng"}],"intvolume":"        48","oa":1,"issue":"4","year":"2012","date_published":"2012-12-01T00:00:00Z","day":"01","publisher":"Springer","arxiv":1,"_id":"3115","title":"Deconstructing approximate offsets","publist_id":"3584","volume":48,"publication":"Discrete & Computational Geometry","status":"public","isi":1,"oa_version":"Preprint","type":"journal_article","doi":"10.1007/s00454-012-9441-5","publication_status":"published","article_processing_charge":"No","author":[{"last_name":"Berberich","full_name":"Berberich, Eric","first_name":"Eric"},{"first_name":"Dan","last_name":"Halperin","full_name":"Halperin, Dan"},{"orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","full_name":"Kerber, Michael","last_name":"Kerber"},{"full_name":"Pogalnikova, Roza","last_name":"Pogalnikova","first_name":"Roza"}],"department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T08:01:36Z","language":[{"iso":"eng"}],"citation":{"ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. <i>Discrete &#38; Computational Geometry</i>. 2012;48(4):964-989. doi:<a href=\"https://doi.org/10.1007/s00454-012-9441-5\">10.1007/s00454-012-9441-5</a>","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2012). Deconstructing approximate offsets. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-012-9441-5\">https://doi.org/10.1007/s00454-012-9441-5</a>","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-012-9441-5\">https://doi.org/10.1007/s00454-012-9441-5</a>.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete &#38; Computational Geometry. 48(4), 964–989.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” <i>Discrete &#38; Computational Geometry</i>, vol. 48, no. 4. Springer, pp. 964–989, 2012.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete &#38; Computational Geometry 48 (2012) 964–989.","mla":"Berberich, Eric, et al. “Deconstructing Approximate Offsets.” <i>Discrete &#38; Computational Geometry</i>, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:<a href=\"https://doi.org/10.1007/s00454-012-9441-5\">10.1007/s00454-012-9441-5</a>."},"corr_author":"1","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"12","external_id":{"arxiv":["1109.2158"],"isi":["000311503200006"]},"page":"964 - 989","acknowledgement":"We thank Eyal Flato (Plataine Ltd.) for raising the offset-deconstruction problem in connection with wood cutting. We also thank Tim Bretl (UIUC) for suggesting the digital-pen offset-deconstruction problem. This work has been supported in part by the Israel Science Foundation (grant no. 1102/11), by the German–Israeli Foundation (grant no. 969/07), by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University, and by the EU Project under Contract No. 255827 (CGL—Computational Geometry Learning).\r\n","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3329"}]}},{"main_file_link":[{"url":"http://arxiv.org/abs/1009.4313","open_access":"1"}],"intvolume":"       148","date_created":"2018-12-11T12:01:30Z","abstract":[{"text":"We introduce a strategy based on Kustin-Miller unprojection that allows us to construct many hundreds of Gorenstein codimension 4 ideals with 9 × 16 resolutions (that is, nine equations and sixteen first syzygies). Our two basic games are called Tom and Jerry; the main application is the biregular construction of most of the anticanonically polarised Mori Fano 3-folds of Altinok's thesis. There are 115 cases whose numerical data (in effect, the Hilbert series) allow a Type I projection. In every case, at least one Tom and one Jerry construction works, providing at least two deformation families of quasismooth Fano 3-folds having the same numerics but different topology. © 2012 Copyright Foundation Compositio Mathematica.","lang":"eng"}],"quality_controlled":"1","date_published":"2012-07-01T00:00:00Z","issue":"4","year":"2012","oa":1,"_id":"3120","day":"01","publisher":"Cambridge University Press","arxiv":1,"publication":"Compositio Mathematica","volume":148,"publist_id":"3579","title":"Fano 3 folds in codimension 4 Tom and Jerry Part I","doi":"10.1112/S0010437X11007226","publication_status":"published","oa_version":"Preprint","type":"journal_article","isi":1,"status":"public","date_updated":"2025-09-30T07:59:55Z","department":[{"_id":"HeEd"}],"article_processing_charge":"No","author":[{"first_name":"Gavin","last_name":"Brown","full_name":"Brown, Gavin"},{"first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","last_name":"Kerber","full_name":"Kerber, Michael"},{"last_name":"Reid","full_name":"Reid, Miles","first_name":"Miles"}],"scopus_import":"1","citation":{"ama":"Brown G, Kerber M, Reid M. Fano 3 folds in codimension 4 Tom and Jerry Part I. <i>Compositio Mathematica</i>. 2012;148(4):1171-1194. doi:<a href=\"https://doi.org/10.1112/S0010437X11007226\">10.1112/S0010437X11007226</a>","chicago":"Brown, Gavin, Michael Kerber, and Miles Reid. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” <i>Compositio Mathematica</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1112/S0010437X11007226\">https://doi.org/10.1112/S0010437X11007226</a>.","apa":"Brown, G., Kerber, M., &#38; Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X11007226\">https://doi.org/10.1112/S0010437X11007226</a>","mla":"Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” <i>Compositio Mathematica</i>, vol. 148, no. 4, Cambridge University Press, 2012, pp. 1171–94, doi:<a href=\"https://doi.org/10.1112/S0010437X11007226\">10.1112/S0010437X11007226</a>.","ista":"Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 148(4), 1171–1194.","ieee":"G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” <i>Compositio Mathematica</i>, vol. 148, no. 4. Cambridge University Press, pp. 1171–1194, 2012.","short":"G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194."},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1009.4313"],"isi":["000307176400007"]},"acknowledgement":"This research is supported by the Korean Government WCU Grant R33-2008-000-10101-0.","page":"1171 - 1194","month":"07","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"quality_controlled":"1","type":"conference","oa_version":"Preprint","date_created":"2018-12-11T12:01:33Z","publication_status":"published","abstract":[{"lang":"eng","text":"When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques.\r\n    We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data, we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1206.4652"}],"status":"public","year":"2012","department":[{"_id":"ChLa"},{"_id":"HeEd"}],"date_published":"2012-06-01T00:00:00Z","date_updated":"2025-06-11T08:09:42Z","oa":1,"author":[{"first_name":"Novi","last_name":"Quadrianto","full_name":"Quadrianto, Novi"},{"full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph"},{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen","full_name":"Chen, Chao"}],"article_processing_charge":"No","publisher":"ML Research Press","arxiv":1,"day":"01","_id":"3127","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"mla":"Quadrianto, Novi, et al. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” <i>Proceedings of the 29th International Conference on Machine Learning</i>, ML Research Press, 2012, pp. 211–18.","ista":"Quadrianto N, Lampert C, Chen C. 2012. The most persistent soft-clique in a set of sampled graphs. Proceedings of the 29th International Conference on Machine Learning. ICML: International Conference on Machine Learning, 211–218.","ieee":"N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in a set of sampled graphs,” in <i>Proceedings of the 29th International Conference on Machine Learning</i>, Edinburgh, United Kingdom, 2012, pp. 211–218.","short":"N. Quadrianto, C. Lampert, C. Chen, in:, Proceedings of the 29th International Conference on Machine Learning, ML Research Press, 2012, pp. 211–218.","ama":"Quadrianto N, Lampert C, Chen C. The most persistent soft-clique in a set of sampled graphs. In: <i>Proceedings of the 29th International Conference on Machine Learning</i>. ML Research Press; 2012:211-218.","chicago":"Quadrianto, Novi, Christoph Lampert, and Chao Chen. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” In <i>Proceedings of the 29th International Conference on Machine Learning</i>, 211–18. ML Research Press, 2012.","apa":"Quadrianto, N., Lampert, C., &#38; Chen, C. (2012). The most persistent soft-clique in a set of sampled graphs. In <i>Proceedings of the 29th International Conference on Machine Learning</i> (pp. 211–218). Edinburgh, United Kingdom: ML Research Press."},"page":"211-218","publication":"Proceedings of the 29th International Conference on Machine Learning","external_id":{"arxiv":["1206.4652"]},"title":"The most persistent soft-clique in a set of sampled graphs","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2012-07-01","start_date":"2012-06-26","location":"Edinburgh, United Kingdom","name":"ICML: International Conference on Machine Learning"},"publist_id":"3572"},{"oa_version":"Preprint","type":"conference","doi":"10.1007/978-3-642-31155-0_17","publication_status":"published","status":"public","department":[{"_id":"HeEd"}],"date_updated":"2025-06-26T08:59:21Z","author":[{"full_name":"Busaryev, Oleksiy","last_name":"Busaryev","first_name":"Oleksiy"},{"first_name":"Sergio","last_name":"Cabello","full_name":"Cabello, Sergio"},{"first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","last_name":"Chen"},{"first_name":"Tamal","last_name":"Dey","full_name":"Dey, Tamal"},{"full_name":"Wang, Yusu","last_name":"Wang","first_name":"Yusu"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"ama":"Busaryev O, Cabello S, Chen C, Dey T, Wang Y. Annotating simplices with a homology basis and its applications. In: Vol 7357. Springer; 2012:189-200. doi:<a href=\"https://doi.org/10.1007/978-3-642-31155-0_17\">10.1007/978-3-642-31155-0_17</a>","apa":"Busaryev, O., Cabello, S., Chen, C., Dey, T., &#38; Wang, Y. (2012). Annotating simplices with a homology basis and its applications (Vol. 7357, pp. 189–200). Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-31155-0_17\">https://doi.org/10.1007/978-3-642-31155-0_17</a>","chicago":"Busaryev, Oleksiy, Sergio Cabello, Chao Chen, Tamal Dey, and Yusu Wang. “Annotating Simplices with a Homology Basis and Its Applications,” 7357:189–200. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31155-0_17\">https://doi.org/10.1007/978-3-642-31155-0_17</a>.","ista":"Busaryev O, Cabello S, Chen C, Dey T, Wang Y. 2012. Annotating simplices with a homology basis and its applications. SWAT: Symposium and Workshops on Algorithm Theory, LNCS, vol. 7357, 189–200.","ieee":"O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices with a homology basis and its applications,” presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.","short":"O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp. 189–200.","mla":"Busaryev, Oleksiy, et al. <i>Annotating Simplices with a Homology Basis and Its Applications</i>. Vol. 7357, Springer, 2012, pp. 189–200, doi:<a href=\"https://doi.org/10.1007/978-3-642-31155-0_17\">10.1007/978-3-642-31155-0_17</a>."},"external_id":{"arxiv":["1107.3793"]},"acknowledgement":"Research was partially supported by the Slovenian Research Agency, program P1-0297 and NSF grant CCF 1064416.","page":"189 - 200","conference":{"end_date":"2012-07-06","name":"SWAT: Symposium and Workshops on Algorithm Theory","location":"Helsinki, Finland","start_date":"2012-07-04"},"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1107.3793","open_access":"1"}],"abstract":[{"text":"Let K be a simplicial complex and g the rank of its p-th homology group Hp(K) defined with ℤ2 coefficients. We show that we can compute a basis H of Hp(K) and annotate each p-simplex of K with a binary vector of length g with the following property: the annotations, summed over all p-simplices in any p-cycle z, provide the coordinate vector of the homology class [z] in the basis H. The basis and the annotations for all simplices can be computed in O(n ω ) time, where n is the size of K and ω &lt; 2.376 is a quantity so that two n×n matrices can be multiplied in O(n ω ) time. The precomputed annotations permit answering queries about the independence or the triviality of p-cycles efficiently.\r\n\r\nUsing annotations of edges in 2-complexes, we derive better algorithms for computing optimal basis and optimal homologous cycles in 1 - dimensional homology. Specifically, for computing an optimal basis of H1(K) , we improve the previously known time complexity from O(n 4) to O(n ω  + n 2 g ω − 1). Here n denotes the size of the 2-skeleton of K and g the rank of H1(K) . Computing an optimal cycle homologous to a given 1-cycle is NP-hard even for surfaces and an algorithm taking 2 O(g) nlogn time is known for surfaces. We extend this algorithm to work with arbitrary 2-complexes in O(n ω ) + 2 O(g) n 2logn time using annotations.\r\n","lang":"eng"}],"intvolume":"      7357","date_created":"2018-12-11T12:01:33Z","alternative_title":["LNCS"],"year":"2012","date_published":"2012-06-19T00:00:00Z","oa":1,"day":"19","arxiv":1,"publisher":"Springer","_id":"3129","title":"Annotating simplices with a homology basis and its applications","volume":7357,"publist_id":"3569"},{"publication":"Proceedings of the twenty-eighth annual symposium on Computational geometry ","publist_id":"3564","title":"Alexander duality for functions: The persistent behavior of land and water and shore","_id":"3133","day":"20","arxiv":1,"publisher":"ACM","date_published":"2012-06-20T00:00:00Z","year":"2012","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1109.5052","open_access":"1"}],"abstract":[{"text":"This note contributes to the point calculus of persistent homology by extending Alexander duality from spaces to real-valued functions. Given a perfect Morse function f: S n+1 →[0, 1 and a decomposition S n+1 = U ∪ V into two (n + 1)-manifolds with common boundary M, we prove elementary relationships between the persistence diagrams of f restricted to U, to V, and to M. ","lang":"eng"}],"date_created":"2018-12-11T12:01:35Z","quality_controlled":"1","external_id":{"arxiv":["1109.5052"]},"page":"249 - 258","acknowledgement":"his research is partially supported by the National Science Foundation (NSF) under grant DBI-0820624, the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.\r\nThe authors thank an anonymous referee for suggesting the simplified proof of the Contravariant PE Theorem given in this paper. They also thank Frederick Cohen, Yuriy Mileyko and Amit Patel for helpful discussions.","conference":{"end_date":"2012-06-20","name":"SCG: Symposium on Computational Geometry","start_date":"2012-06-17","location":"Chapel Hill, NC, USA"},"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","corr_author":"1","citation":{"ama":"Edelsbrunner H, Kerber M. Alexander duality for functions: The persistent behavior of land and water and shore. In: <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>. ACM; 2012:249-258. doi:<a href=\"https://doi.org/10.1145/2261250.2261287\">10.1145/2261250.2261287</a>","apa":"Edelsbrunner, H., &#38; Kerber, M. (2012). Alexander duality for functions: The persistent behavior of land and water and shore. In <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i> (pp. 249–258). Chapel Hill, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2261250.2261287\">https://doi.org/10.1145/2261250.2261287</a>","chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” In <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, 249–58. ACM, 2012. <a href=\"https://doi.org/10.1145/2261250.2261287\">https://doi.org/10.1145/2261250.2261287</a>.","ieee":"H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i>, Chapel Hill, NC, USA, 2012, pp. 249–258.","ista":"Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.","short":"H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–258.","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, ACM, 2012, pp. 249–58, doi:<a href=\"https://doi.org/10.1145/2261250.2261287\">10.1145/2261250.2261287</a>."},"language":[{"iso":"eng"}],"date_updated":"2025-06-11T08:10:04Z","department":[{"_id":"HeEd"}],"author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299"}],"article_processing_charge":"No","doi":"10.1145/2261250.2261287","publication_status":"published","oa_version":"Preprint","type":"conference","status":"public"},{"quality_controlled":"1","type":"conference","oa_version":"None","date_created":"2018-12-11T12:01:35Z","publication_status":"published","abstract":[{"text":"It has been an open question whether the sum of finitely many isotropic Gaussian kernels in n ≥ 2 dimensions can have more modes than kernels, until in 2003 Carreira-Perpiñán and Williams exhibited n +1 isotropic Gaussian kernels in ℝ n with n + 2 modes. We give a detailed analysis of this example, showing that it has exponentially many critical points and that the resilience of the extra mode grows like √n. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes. ","lang":"eng"}],"doi":"10.1145/2261250.2261265","status":"public","year":"2012","department":[{"_id":"HeEd"}],"date_published":"2012-06-20T00:00:00Z","date_updated":"2025-09-29T14:02:00Z","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"last_name":"Fasy","full_name":"Fasy, Brittany","first_name":"Brittany"},{"last_name":"Rote","full_name":"Rote, Günter","first_name":"Günter"}],"publisher":"ACM","day":"20","_id":"3134","scopus_import":1,"language":[{"iso":"eng"}],"citation":{"ista":"Edelsbrunner H, Fasy B, Rote G. 2012. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 91–100.","ieee":"H. Edelsbrunner, B. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” in <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i>, Chapel Hill, NC, USA, 2012, pp. 91–100.","short":"H. Edelsbrunner, B. Fasy, G. Rote, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100.","mla":"Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, ACM, 2012, pp. 91–100, doi:<a href=\"https://doi.org/10.1145/2261250.2261265\">10.1145/2261250.2261265</a>.","apa":"Edelsbrunner, H., Fasy, B., &#38; Rote, G. (2012). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i> (pp. 91–100). Chapel Hill, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2261250.2261265\">https://doi.org/10.1145/2261250.2261265</a>","chicago":"Edelsbrunner, Herbert, Brittany Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” In <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, 91–100. ACM, 2012. <a href=\"https://doi.org/10.1145/2261250.2261265\">https://doi.org/10.1145/2261250.2261265</a>.","ama":"Edelsbrunner H, Fasy B, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In: <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>. ACM; 2012:91-100. doi:<a href=\"https://doi.org/10.1145/2261250.2261265\">10.1145/2261250.2261265</a>"},"publication":"Proceedings of the twenty-eighth annual symposium on Computational geometry ","related_material":{"record":[{"id":"2815","status":"public","relation":"later_version"}]},"acknowledgement":"This research is partially supported by the National Science Foun- dation (NSF) under grant DBI-0820624, by the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.","page":"91 - 100","title":"Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"06","conference":{"location":"Chapel Hill, NC, USA","start_date":"2012-06-17","name":"SCG: Symposium on Computational Geometry","end_date":"2012-06-20"},"publist_id":"3563"},{"day":"06","publisher":"Public Library of Science","_id":"3159","ddc":["510"],"publication":"PLoS One","title":"Hierarchical ordering of reticular networks","publist_id":"3530","volume":7,"quality_controlled":"1","abstract":[{"lang":"eng","text":"The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the &quot;root&quot; of the network (e.g., the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied to networks with loops because they they create a contradiction in the edge ordering in terms of which edge precedes another in the hierarchy. Here, we present a generalization of the Horton-Strahler order to weighted planar reticular networks, where weights are assumed to correlate with the importance of network edges, e.g., weights estimated from edge widths may correlate to flow capacity. Our method assigns hierarchical levels not only to edges of the network, but also to its loops, and classifies the edges into reticular edges, which are responsible for loop formation, and tree edges. In addition, we perform a detailed and rigorous theoretical analysis of the sensitivity of the hierarchical levels to weight perturbations. In doing so, we show that the ordering of the reticular edges is more robust to noise in weight estimation than is the ordering of the tree edges. We discuss applications of this generalized Horton-Strahler ordering to the study of leaf venation and other biological networks."}],"date_created":"2018-12-11T12:01:44Z","intvolume":"         7","issue":"6","year":"2012","date_published":"2012-06-06T00:00:00Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"file_date_updated":"2020-07-14T12:46:01Z","scopus_import":"1","language":[{"iso":"eng"}],"pubrep_id":"385","article_number":"e36715","has_accepted_license":"1","citation":{"short":"Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).","ieee":"Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” <i>PLoS One</i>, vol. 7, no. 6. Public Library of Science, 2012.","ista":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715.","mla":"Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” <i>PLoS One</i>, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pone.0036715\">10.1371/journal.pone.0036715</a>.","apa":"Mileyko, Y., Edelsbrunner, H., Price, C., &#38; Weitz, J. (2012). Hierarchical ordering of reticular networks. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0036715\">https://doi.org/10.1371/journal.pone.0036715</a>","chicago":"Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz. “Hierarchical Ordering of Reticular Networks.” <i>PLoS One</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pone.0036715\">https://doi.org/10.1371/journal.pone.0036715</a>.","ama":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. Hierarchical ordering of reticular networks. <i>PLoS One</i>. 2012;7(6). doi:<a href=\"https://doi.org/10.1371/journal.pone.0036715\">10.1371/journal.pone.0036715</a>"},"external_id":{"isi":["000305348400006"]},"file":[{"creator":"kschuh","content_type":"application/pdf","date_created":"2019-02-05T12:38:43Z","access_level":"open_access","file_id":"5922","file_size":541583,"checksum":"515a98ad72e470752f03f13663dcaff8","relation":"main_file","file_name":"2012_PLoS_Mileyko.PDF","date_updated":"2020-07-14T12:46:01Z"}],"acknowledgement":"his work was supported by the National Science Foundation Plant Genome Research Program (grant 0820624 to H.E. and J.S.W.), the Defense Advanced Projects Research Agency (grant HR0011-09-1-0055 to H.E. and J.S.W.), and the European Science Foundation (under the Research Networking Programme on “Applied and Computational Algebraic Topology” run by H.E.). Joshua S. Weitz, Ph.D., holds a Career Award at the Scientific Interface from the Burroughs Wellcome Fund.\r\n\r\n\r\n\r\nDuring preparation of this manuscript the authors became aware of a related work by Katifori and Magnasco (arXiv:1110.1412v1), concurrently submitted and accepted for publication in PLoS ONE.","month":"06","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","type":"journal_article","doi":"10.1371/journal.pone.0036715","publication_status":"published","status":"public","isi":1,"department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T07:53:26Z","article_processing_charge":"No","author":[{"last_name":"Mileyko","full_name":"Mileyko, Yuriy","first_name":"Yuriy"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Price, Charles","last_name":"Price","first_name":"Charles"},{"first_name":"Joshua","last_name":"Weitz","full_name":"Weitz, Joshua"}]},{"issue":"2","year":"2012","date_published":"2012-03-01T00:00:00Z","oa":1,"quality_controlled":"1","date_created":"2018-12-11T12:02:17Z","abstract":[{"lang":"eng","text":"We use a distortion to define the dual complex of a cubical subdivision of ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated by the topological analysis of high-dimensional digital image data, we consider such subdivisions defined by generalizations of quad- and oct-trees to n dimensions. Assuming the subdivision is balanced, we show that mapping each vertex to the center of the corresponding n-cube gives a geometric realization of the dual complex in ℝ n."}],"intvolume":"        47","publication":"Discrete & Computational Geometry","title":"Dual complexes of cubical subdivisions of ℝn","publist_id":"3398","volume":47,"day":"01","publisher":"Springer","_id":"3256","ddc":["000"],"department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T07:43:46Z","article_processing_charge":"No","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Submitted Version","type":"journal_article","doi":"10.1007/s00454-011-9382-4","publication_status":"published","status":"public","isi":1,"external_id":{"isi":["000299057200010"]},"page":"393 - 414","acknowledgement":"This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well as the National Science Foundation (NSF) under grant DBI-0820624.","file":[{"date_created":"2018-12-12T10:08:15Z","access_level":"open_access","file_id":"4675","content_type":"application/pdf","creator":"system","file_name":"IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf","date_updated":"2020-07-14T12:46:05Z","file_size":203636,"checksum":"76486f3b2c9e7fd81342f3832ca387e7","relation":"main_file"}],"month":"03","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:46:05Z","corr_author":"1","scopus_import":"1","pubrep_id":"543","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"mla":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>.","ieee":"H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of ℝn,” <i>Discrete &#38; Computational Geometry</i>, vol. 47, no. 2. Springer, pp. 393–414, 2012.","short":"H. Edelsbrunner, M. Kerber, Discrete &#38; Computational Geometry 47 (2012) 393–414.","ista":"Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete &#38; Computational Geometry. 47(2), 393–414.","ama":"Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. 2012;47(2):393-414. doi:<a href=\"https://doi.org/10.1007/s00454-011-9382-4\">10.1007/s00454-011-9382-4</a>","chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>.","apa":"Edelsbrunner, H., &#38; Kerber, M. (2012). Dual complexes of cubical subdivisions of ℝn. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-011-9382-4\">https://doi.org/10.1007/s00454-011-9382-4</a>"}},{"status":"public","doi":"10.1109/ICCV.2011.6126486","date_created":"2018-12-11T12:02:21Z","publication_status":"published","abstract":[{"lang":"eng","text":"We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and scales, into larger interpretations (tilings) of the entire image. Inference is cast as optimization over sets of maximal cliques sampled from a graph connecting all non-overlapping figure-ground segment hypotheses. Potential functions over cliques combine unary, Gestalt-based figure qualities, and pairwise compatibilities among spatially neighboring segments, constrained by T-junctions and the boundary interface statistics of real scenes. Learning the model parameters is based on maximum likelihood, alternating between sampling image tilings and optimizing their potential function parameters. State of the art results are reported on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where a 28% improvement was achieved."}],"oa_version":"None","quality_controlled":"1","type":"conference","author":[{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","last_name":"Ion","full_name":"Ion, Adrian"},{"full_name":"Carreira, Joao","last_name":"Carreira","first_name":"Joao"},{"first_name":"Cristian","last_name":"Sminchisescu","full_name":"Sminchisescu, Cristian"}],"date_updated":"2021-01-12T07:42:15Z","date_published":"2012-01-12T00:00:00Z","department":[{"_id":"HeEd"}],"year":"2012","article_number":"6126486","citation":{"ama":"Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition into maximal cliques. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>","chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. <a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">https://doi.org/10.1109/ICCV.2011.6126486</a>.","ista":"Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.","ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.","mla":"Ion, Adrian, et al. <i>Image Segmentation by Figure-Ground Composition into Maximal Cliques</i>. 6126486, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126486\">10.1109/ICCV.2011.6126486</a>."},"language":[{"iso":"eng"}],"_id":"3265","day":"12","publisher":"IEEE","publist_id":"3382","conference":{"name":"ICCV: International Conference on Computer Vision","start_date":"2011-11-06","location":"Barcelona, Spain","end_date":"2011-11-13"},"month":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Image segmentation by figure-ground composition into maximal cliques"},{"publisher":"Elsevier","day":"01","_id":"3310","ddc":["000"],"publication":"Pattern Recognition Letters","title":"A point calculus for interlevel set homology","publist_id":"3330","volume":33,"quality_controlled":"1","intvolume":"        33","abstract":[{"lang":"eng","text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology."}],"date_created":"2018-12-11T12:02:36Z","year":"2012","issue":"11","date_published":"2012-08-01T00:00:00Z","oa":1,"file_date_updated":"2020-07-14T12:46:06Z","scopus_import":"1","pubrep_id":"542","language":[{"iso":"eng"}],"citation":{"ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. 2012;33(11):1436-1444. doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>","apa":"Bendich, P., Cabello, S., &#38; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>","chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">https://doi.org/10.1016/j.patrec.2011.10.007</a>.","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” <i>Pattern Recognition Letters</i>, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” <i>Pattern Recognition Letters</i>, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:<a href=\"https://doi.org/10.1016/j.patrec.2011.10.007\">10.1016/j.patrec.2011.10.007</a>."},"has_accepted_license":"1","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","page":"1436 - 1444","file":[{"relation":"main_file","checksum":"d65f79775b51258a604ca5ec741297cc","file_size":280280,"date_updated":"2020-07-14T12:46:06Z","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf","content_type":"application/pdf","creator":"system","file_id":"5116","access_level":"open_access","date_created":"2018-12-12T10:15:00Z"}],"external_id":{"isi":["000307204300002"]},"month":"08","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","oa_version":"Submitted Version","publication_status":"published","doi":"10.1016/j.patrec.2011.10.007","status":"public","isi":1,"department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T07:39:47Z","article_processing_charge":"No","author":[{"last_name":"Bendich","full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"first_name":"Sergio","full_name":"Cabello, Sergio","last_name":"Cabello"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}]},{"title":"A worst case bound for topology computation of algebraic curves","publist_id":"3303","volume":47,"publication":" Journal of Symbolic Computation","day":"01","arxiv":1,"publisher":"Elsevier","_id":"3331","oa":1,"issue":"3","year":"2012","date_published":"2012-03-01T00:00:00Z","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1104.1510","open_access":"1"}],"date_created":"2018-12-11T12:02:43Z","abstract":[{"text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with  bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve.","lang":"eng"}],"intvolume":"        47","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"03","external_id":{"isi":["000300115300002"],"arxiv":["1104.1510"]},"page":"239 - 258","language":[{"iso":"eng"}],"citation":{"ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. 2012;47(3):239-258. doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>","chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>.","apa":"Kerber, M., &#38; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>.","short":"M. Kerber, M. Sagraloff,  Journal of Symbolic Computation 47 (2012) 239–258.","ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves.  Journal of Symbolic Computation. 47(3), 239–258."},"corr_author":"1","scopus_import":"1","author":[{"full_name":"Kerber, Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"first_name":"Michael","full_name":"Sagraloff, Michael","last_name":"Sagraloff"}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"date_updated":"2025-09-30T07:33:48Z","status":"public","isi":1,"oa_version":"Preprint","type":"journal_article","doi":"10.1016/j.jsc.2011.11.001","publication_status":"published"}]