Kinetic data structures in the black-box model

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

[1]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

[2]  Young-Joo Moon,et al.  Stochastic models for quality of service of component connectors , 2011 .

[3]  Bastiaan Stephan Graaf,et al.  Model-Driven Evolution of Software Architectures , 2007, 11th European Conference on Software Maintenance and Reengineering (CSMR'07).

[4]  D. E. Nadales Agut,et al.  A Compositional Interchange Format for Hybrid Systems: Design and Implementation , 2012 .

[5]  L. Schmetterer.  Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete. , 1963 .

[6]  A. Rodriguez Yakushev,et al.  Towards Getting Generic Programming Ready for Prime Time , 2009 .

[7]  Harmen Kastenberg.  Graph-based software specification and verification , 2008 .

[8]  Pankaj K. Agarwal,et al.  Untangling triangulations through local explorations , 2008, SCG '08.

[9]  Z. Drezner.  On the rectangular p‐center problem , 1987 .

[10]  Hugo Jonker,et al.  Security matters : privacy in voting and fairness in digital exchange , 2009 .

[11]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[12]  Oscar H. Ibarra,et al.  On spiking neural P systems , 2006, Natural Computing.

[13]  Jeff Erickson,et al.  Dense point sets have sparse Delaunay triangulations , 2001, ArXiv.

[14]  K. Tsirogiannis,et al.  Analysis of flow and visibility on triangulated terrains , 2011 .

[15]  M. G. van der Horst,et al.  Scalable block processing algorithms , 2008 .

[16]  Leonidas J. Guibas,et al.  Deformable spanners and applications , 2004, SCG '04.

[17]  Dmitri Jarnikov,et al.  QoS framework for video streaming in home networks , 2007 .

[18]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

[19]  Diego Borro,et al.  Approximation of Optimal Voxel Size for Collision Detection in Maintainability Simulations within Massive Virtual Environments , 2004, Comput. Graph. Forum.

[20]  Bettina Speckmann,et al.  Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes , 2012, ESA.

[21]  Thomas Bäck,et al.  Mixed-integer evolution strategies for parameter optimization and their applications to medical image analysis , 2005 .

[22]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[23]  Lennart C. L. Kats,et al.  Building Blocks for Language Workbenches , 2011 .

[24]  D. Costa.  Formal models for component connectors , 2010 .

[25]  David M. Mount,et al.  A computational framework for incremental motion , 2004, SCG '04.

[26]  W. Kuijper.  Compositional Synthesis of Safety Controllers , 2012 .

[27]  Piotr Indyk,et al.  Approximate clustering via core-sets , 2002, STOC '02.

[28]  Anton Wijs,et al.  Silent steps in transition systems and Markov chains , 2007 .

[29]  H. Hansen.  Coalgebraic Modelling : Applications in Automata theory and Modal logic , 2009 .

[30]  Damiano Bolzoni,et al.  Revisiting Anomaly-based Network Intrusion Detection Systems , 2009 .

[31]  Ali Mesbah,et al.  Analysis and Testing of Ajax-based Single-page Web Applications , 2009 .

[32]  Marius Adrian Marin,et al.  An Integrated System to Manage Crosscutting Concerns in Source Code , 2008 .

[33]  Bas Basten,et al.  Ambiguity Detection for Programming Language Grammars , 2011 .

[34]  Olfa Arfaoui,et al.  Mining Semi-structured Data , 2015, ArXiv.

[35]  Pascal Durr,et al.  Resource-based Verification for Robust Composition of Aspects , 2008 .

[36]  Ncwm Niels Braspenning.  Model-based integration and testing of high-tech multi-disciplinary systems , 2008 .

[37]  Hendrik Michaël van der Bijl,et al.  On changing models in model-based testing , 2011 .

[38]  R. Bakhshi.  Gossiping Models : Formal Analysis of Epidemic Protocols , 2011 .

[39]  Tim K. Cocx,et al.  Metrics and visualisation for crime analysis and genomics , 2005 .

[40]  Ljp Luc Engelen.  From napkin sketches to reliable software , 2012 .

[41]  Aad Mathssen,et al.  Logical Calculi for Reasoning with Binding , 2008 .

[42]  Mari Antonius Cornelis Dekker,et al.  Flexible Access Control for Dynamic Collaborative Environments , 2009 .

[43]  R.S.S. O'Connor,et al.  Incompleteness & completeness : formalizing logic and analysis in type theory , 2005 .

[44]  Gürcan Gülesir,et al.  Evolvable Behavior Specifications Using Context-Sensitive Wildcards , 2008 .

[45]  J. van den Berg,et al.  Reasoning about Java programs in PVS using JML , 2009 .

[46]  Kab Kevin Verbeek.  Algorithms for cartographic visualization , 2012 .

[47]  Mohammad Mahdi Jaghoori,et al.  Time At Your Service: Schedulability Analysis of Real-Time and Distributed Services , 2010 .

[48]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[49]  Mark de Berg,et al.  Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions , 2010, Comput. Geom..

[50]  A Adam Koprowski,et al.  Termination of rewriting and its certification , 2004 .

[51]  Gabriel Zachmann,et al.  Collision Detection for Deformable Objects , 2004, Comput. Graph. Forum.

[52]  Mohammed G. Khatib.  MEMS-Based Storage Devices : Integration in Energy-Constrained Mobile Systems , 2009 .

[53]  John Businge,et al.  Co-evolution of the Eclipse SDK Framework and Its Third-Party Plug-Ins , 2013, 2013 17th European Conference on Software Maintenance and Reengineering.

[54]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

[55]  Jonathan Richard Shewchuk,et al.  Star splaying: an algorithm for repairing delaunay triangulations and convex hulls , 2005, SCG.

[56]  A. Rényi,et al.  über die konvexe Hülle von n zufÄllig gewÄhlten Punkten. II , 1964 .

[57]  Marcel Verhoef,et al.  Modeling and validating distributed embedded real-time control systems , 2009 .

[58]  Laura Brandán Briones,et al.  Theories for Model-based Testing: Real-time and Coverage , 2007 .

[59]  Jeroen Doumen,et al.  Searching in encrypted data , 2004 .

[60]  van Mpwj Michiel Osch.  Automated model-based testing of hybrid systems , 2009 .

[61]  Leonidas J. Guibas,et al.  Fast collision detection among multiple moving spheres , 1997, SCG '97.

[62]  Arjen van Weelden,et al.  Putting Types To Good Use , 2007 .

[63]  Anton Wijs,et al.  What to do next? Analysing and optimising system behaviour in time , 2007 .

[64]  Aah Ammar Osaiweran.  Formal development of control software in the medical systems domain , 2012 .

[65]  Scw Bas Ploeger,et al.  Improved verification methods for concurrent systems , 2009 .

[66]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[67]  David M. Mount,et al.  Approximation algorithm for the kinetic robust K-center problem , 2010, Comput. Geom..

[68]  Miguel E. Andrés,et al.  Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems , 2011, ArXiv.

[69]  Magiel Bruntink,et al.  Renovation of idiomatic crosscutting concerns in embedded systems , 2005 .

[70]  Zef Hemel.  Methods and Techniques for the Design and Implementation of Domain-Specific Languages , 2012 .

[71]  B. J. Arnoldus,et al.  An illumination of the template enigma : software code generation with templates , 2011 .

[72]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[73]  Sander Vermolen,et al.  Software Language Evolution , 2008, 2008 15th Working Conference on Reverse Engineering.

[74]  Simon Kahan,et al.  A model for data in motion , 1991, STOC '91.

[75]  Micha Sharir.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1997, Discret. Comput. Geom..

[76]  Leonidas J. Guibas,et al.  Deformable Free-Space Tilings for Kinetic Collision Detection† , 2002, Int. J. Robotics Res..

[77]  Hasan Sözer,et al.  Architecting Fault-Tolerant Software Systems , 2009 .

[78]  Pankaj K. Agarwal,et al.  Exact and Approximation Algortihms for Clustering , 1997 .

[79]  C. J. Boogerd,et al.  Focusing Automatic Code Inspections , 2010 .

[80]  Michael Segal.  Lower Bounds for Covering Problems , 2002, J. Math. Model. Algorithms.

[81]  J. Kwisthout,et al.  The Computational Complexity of Probabilistic Networks , 2009 .

[82]  Srinivas Aluru,et al.  Dynamic Compressed Hypertoctrees with Application to the N-Body Problem , 1999, FSTTCS.

[83]  de Hayco Jong.  Flexible heterogeneous software systems , 2007 .

[84]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[85]  Qin Zhang,et al.  Multi-dimensional online tracking , 2009, SODA.

[86]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[87]  Timothy M. Chan.  Output-sensitive results on convex hulls, extreme points, and related problems , 1995, SCG '95.

[88]  Ronald Middelkoop,et al.  Capturing and exploiting abstract views of states in OO verification , 2011 .

[89]  B. Lijnse,et al.  TOP to the rescue. Task-oriented programming for incident response applications , 2005 .

[90]  Gerhard de Koning Gans,et al.  Outsmarting smart cards , 2013 .

[91]  Lionel Mamane,et al.  Interactive mathematical documents: creation and presentation , 2004 .

[92]  Menelaos I. Karavelas,et al.  Voronoi Diagrams for Moving Disks and Applications , 2001, WADS.

[93]  Karina R. Olmos Joffré.  Strategies for Context Sensitive Program Transformation , 2009 .

[94]  Raimund Seidel.  Convex Hull Computations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[95]  M. T. de Berg,et al.  Algorithms for Fat Objects: Decompositions and Applications , 2004 .

[96]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[97]  Doron Nussbaum,et al.  Rectilinear p-piercing problems , 1997, ISSAC.

[98]  Timothy M. Chan.  More planar two-center algorithms , 1999, Comput. Geom..

[99]  Mark Timmer,et al.  Efficient modelling, generation and analysis of Markov automata , 2013 .

[100]  Ileana Buhan,et al.  Cryptographic keys from noisy data, theory and applications , 2008 .

[101]  Tim K. Cocx,et al.  Algorithmic tools for data-oriented law enforcement , 2009 .

[102]  M. S. Greiler,et al.  Test Suite Comprehension for Modular and Dynamic Systems , 2013 .

[103]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[104]  M. Torabi Dashti,et al.  Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols , 2008 .

[105]  Ivan S. Zapreev.  Model checking Markov chains : techniques and tools , 2008 .

[106]  Dhp Dirk Gerrits.  Pushing and pulling : computing push plans for disk-shaped robots, and dynamic labelings for moving points , 2013 .

[107]  Hossein Rahmani,et al.  Analysis of protein-protein interaction networks by means of annotated graph mining algorithms , 2012 .

[108]  de Ism Ivo Jong.  Integration and test strategies for complex manufacturing machines , 2008 .

[109]  Mark de Berg,et al.  Realistic input models for geometric algorithms , 1997, SCG '97.

[110]  A. M. Andrew,et al.  Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..

[111]  Bettina Speckmann,et al.  Kinetic collision detection for simple polygons , 2000, SCG '00.

[112]  Tingting Han,et al.  Diagnosis, Synthesis and Analysis of Probabilistic Models , 2009, Ausgezeichnete Informatikdissertationen.

[113]  Micha Sharir,et al.  Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

[114]  Jane Wilhelms,et al.  Collision Detection and Response for Computer Animation , 1988, SIGGRAPH.

[115]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[116]  Pierre Alliez,et al.  Filtering Relocations on a Delaunay Triangulation , 2009, Comput. Graph. Forum.

[117]  Jens R. Calamé,et al.  Testing reactive systems with data: enumerative methods and constraint solving , 2008 .

[118]  Martin Bravenboer,et al.  Exercises in Free Syntax. Syntax Definition, Parsing, and Assimilation of Language Conglomerates , 2003 .

[119]  Bettina Speckmann,et al.  Kinetic 2-centers in the black-box model , 2013, SoCG '13.

[120]  Flavio D. Garcia.  Formal and Computational Cryptography: Protocols, Hashes and Commitments , 2008 .

[121]  Sander van der Burg,et al.  A Reference Architecture for Distributed Software Deployment , 2013 .

[122]  Trajce Dimkov,et al.  Alignment of organizational security policies: Theory and Practice , 2012 .

[123]  Georgeta Igna,et al.  Performance analysis of real-time task systems using timed automata , 2013 .

[124]  T. D. Vu,et al.  Semantics and applications of process and program algebra , 2007 .

[125]  Bettina Speckmann,et al.  Kinetic convex hulls and delaunay triangulations in the black-box model , 2011, SoCG '11.

[126]  M. J. de Mol,et al.  Reasoning about functional programs : Sparkle, a proof assistant for Clean , 2009 .

[127]  David M. Mount,et al.  Maintaining Nets and Net Trees under Incremental Motion , 2009, ISAAC.

[128]  G.S. Brodal,et al.  Dynamic planar convex hull , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[129]  Sebastiaan Gijsbert Marinus Cornelissen,et al.  Evaluating Dynamic Analysis Techniques for Program Comprehension , 2009 .

[130]  Seyyed Hamed Hashemi,et al.  Studies on verification of wireless sensor networks and abstraction learning for system inference , 2008 .

[131]  H. Raynaud.  Sur L'enveloppe convexe des nuages de points aleatoires dans Rn . I , 1970 .

[132]  M. D. Berg,et al.  Optimal Geometric Data Structures , 2007 .

[133]  Michiel H. M. Smid,et al.  Computing the Greedy Spanner in Near-Quadratic Time , 2008, Algorithmica.

[134]  David G. Kirkpatrick,et al.  Bounded-Velocity Approximation of Mobile Euclidean 2-Centres , 2008, Int. J. Comput. Geom. Appl..

[135]  Jja Jeroen Keiren,et al.  Advanced reduction techniques for model checking , 2013 .

[136]  Werner Heijstek,et al.  Architecture design in global and model-centric software development , 2012 .

[137]  Fpm Frank Stappers.  Bridging formal models : an engineering perspective , 2012 .

[138]  van Mf Marcel Amstel,et al.  Assessing and improving the quality of model transformations , 2012 .

[139]  Jasen Markovski,et al.  Real and stochastic time in process algebras for performance evaluation , 2008 .

[140]  Kamran Iqbal,et al.  Collision detection: A survey , 2007, 2007 IEEE International Conference on Systems, Man and Cybernetics.

[141]  Marcin Czenko,et al.  TuLiP : reshaping trust management , 2009 .

[142]  Bettina Speckmann,et al.  Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model , 2012, J. Comput. Geom..

[143]  Farhad Arbab,et al.  Model Checking of Component Connectors , 2007, 31st Annual International Computer Software and Applications Conference (COMPSAC 2007).

[144]  Hagen Spies,et al.  Motion , 2000, Computer Vision and Applications.

[145]  E Elena Mumford,et al.  Drawing graphs for cartographic applications , 2008 .

[146]  Leonidas J. Guibas,et al.  Kinetic Connectivity for Unit Disks , 2001, Discret. Comput. Geom..

[147]  Joachim Gehweiler,et al.  Kinetic Facility Location , 2008, Algorithmica.

[148]  Bettina Speckmann,et al.  Kinetic Collision Detection for Convex Fat Objects , 2006, ESA.

[149]  Ichiro Hasuo,et al.  Tracing Anonymity with Coalgebras , 2008 .

[150]  Mark de Berg,et al.  Out-of-Order Event Processing in Kinetic Data Structures , 2009, Algorithmica.

[151]  Timothy M. Chan,et al.  Instance-Optimal Geometric Algorithms , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[152]  Eduardo Zambon,et al.  Abstract Graph Transformation - Theory and Practice , 2013 .

[153]  Saeed Sedghi,et al.  Towards Provably Secure Efficiently Searchable Encryption , 2012 .

[154]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[155]  Michael L. Accorsi,et al.  Finite element mesh update methods for fluid-structure interaction simulations , 2004 .

[156]  Stephanie Kemper,et al.  Modelling and analysis of real-time coordination patterns , 2011 .

[157]  Adriaan Middelkoop,et al.  Inference of Program Properties with Attribute Grammars, Revisited , 2012 .

[158]  Francis Y. L. Chin,et al.  Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time , 1999, SIAM J. Comput..

[159]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[160]  Olivier Devillers,et al.  On deletion in Delaunay triangulations , 1999, SCG '99.

[161]  EM Elena Bortnik,et al.  Formal methods in support of SMC design , 2008 .

[162]  Michael Hoffmann.  A simple linear algorithm for computing rectangle 3-centers , 1999, CCCG.

[163]  Bettina Speckmann.  Kinetic Data Structures , 2008, Encyclopedia of Algorithms.

[164]  Mark de Berg,et al.  Linear Size Binary Space Partitions for Uncluttered Scenes , 2000, Algorithmica.

[165]  Marshall W. Bern,et al.  Triangulations and Mesh Generation , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[166]  Sariel Har-Peled.  Geometric Approximation Algorithms , 2011 .

[167]  Mohammad Ali Abam.  New data structures and algorithms for mobile data , 2007 .