An Evaluation of Decentralized Group Formation Techniques for Flying Light Specks
Article No.: 84, Pages 1 - 7
Abstract
Group formation is fundamental for 3D displays that use Flying Light Specks, FLSs, to illuminate shapes and provide haptic interactions. An FLS is a drone with light sources that illuminates a shape. Groups of G FLSs may implement reliability techniques to tolerate FLS failures, provide kinesthetic haptic feedback in response to a user’s touch, and facilitate a divide and conquer approach to challenges such as localizing FLSs to render a shape. This paper evaluates four decentralized techniques to form groups. An FLS implements a technique autonomously using asynchronous communication and without a global clock. We evaluate these techniques using synthetic point clouds with known optimal solutions and real point clouds. Obtained results show a technique named Random Subset (RS) is superior when constructing small groups (G ≤ 5) while a different technique named Closest Available Neighbor First (CANF) is superior when constructing large groups (G ≥ 10).
References
[1]
Hamed Alimohammadzadeh, Daryon Mehraban, and Shahram Ghandeharizadeh. 2023. Modeling Illumination Data with Flying Light Specks. In ACM Multimedia Systems (Vancouver, Canada) (MMSys ’23). Association for Computing Machinery, New York, NY, USA. https://doi.org/10.1145/3587819.3592544
[2]
David Arthur and Sergei Vassilvitskii. 2007. K-Means++: The Advantages of Careful Seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, Louisiana) (SODA ’07). Society for Industrial and Applied Mathematics, USA, 1027–1035.
[3]
Jack Brimberg, Nenad Mladenović, Dragan Urošević, and Eric Ngai. 2009. Variable Neighborhood Search for the Heaviest k-Subgraph. Computers & Operations Research 36, 11 (2009), 2885–2891. https://doi.org/10.1016/j.cor.2008.12.020
[4]
Anna Chmielowiec and Maarten van Steen. 2010. Optimal Decentralized Formation of k-Member Partnerships. In IEEE International Conference on Self-Adaptive and Self-Organizing Systems. 154–163. https://doi.org/10.1109/SASO.2010.14
[5]
Anna Chmielowiec, Spyros Voulgaris, and Maarten van Steen. 2014. Decentralized Group Formation. Journal of Internet Services and Applications 5, 1 (2014). https://doi.org/10.1186/s13174-014-0012-2
[6]
Vincent Cohen-Addad, Hossein Esfandiari, Vahab Mirrokni, and Shyam Narayanan. 2022. Improved Approximations for Euclidean K-Means and k-Median, via Nested Quasi-Independent Sets. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Rome, Italy) (STOC 2022). Association for Computing Machinery, New York, NY, USA, 1621–1628. https://doi.org/10.1145/3519935.3520011
[7]
P. Crescenzi and V. Kann. 1997. Approximation on the web: A compendium of NP optimization problems. In Randomization and Approximation Techniques in Computer Science, José Rolim (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 111–118.
[8]
Andrzej Czygrinow and Michal Hańćkowiak. 2007. Distributed Approximations for Packing in Unit-Disk Graphs. In Distributed Computing - 21st International Symposium, DISC 2007, Proceedings(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Springer Verlag, 152–164. https://doi.org/10.1007/978-3-540-75142-7_14 21st International Symposium on Distributed Computing, DISC 2007 ; Conference date: 24-09-2007 Through 26-09-2007.
[9]
Andrzej Czygrinow, Michal Hańckowiak, and Wojciech Wawrzyniak. 2008. Distributed Packing in Planar Graphs. In Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures (Munich, Germany) (SPAA ’08). Association for Computing Machinery, New York, NY, USA, 55–61. https://doi.org/10.1145/1378533.1378541
[10]
Avis David. 1983. A Survey of Heuristics for the Weighted Matching Problem. Networks 13 (1983), 475–493.
[11]
Harold N. Gabow. 1990. Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, California, USA) (SODA ’90). Society for Industrial and Applied Mathematics, USA, 434–443.
[12]
Shahram Ghandeharizadeh. 2021. Holodeck: Immersive 3D Displays Using Swarms of Flying Light Specks. In ACM Multimedia Asia (Gold Coast, Australia). https://doi.org/10.1145/3469877.3493698
[13]
Shahram Ghandeharizadeh. 2022. Display of 3D Illuminations using Flying Light Specks. In ACM Multimedia (Lisboa, Portugal) (MM ’22). Association for Computing Machinery, New York, NY, USA. https://doi.org/10.1145/3503161.3548250
[14]
P. Hell, S. Klein, L. T. Nogueira, and F. Protti. 2005. Packing r-Cliques in Weighted Chordal Graphs. Annals of Operations Research 138, 1 (2005), 179–187. https://doi.org/10.1007/s10479-005-2452-3
[15]
Edmonds Jack. 1965. Paths, Trees, and Flowers. Canada Journal of Math. 17 (1965), 449–467.
[16]
Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. 2009. T-Man: Gossip-Based Fast Overlay Topology Construction. Comput. Netw. 53, 13 (aug 2009), 2321–2339. https://doi.org/10.1016/j.comnet.2009.03.013
[17]
Viggo Kann. 1994. Maximum Bounded H-Matching is Max SNP-Complete. Inf. Process. Lett. 49, 6 (mar 1994), 309–318. https://doi.org/10.1016/0020-0190(94)90105-8
[18]
David G. Kirkpatrick and Pavol Hell. 1978. On the Completeness of a Generalized Matching Problem. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, California, USA) (STOC ’78). Association for Computing Machinery, New York, NY, USA, 240–245. https://doi.org/10.1145/800133.804353
[19]
Dušan Knop. 2020. Partitioning Graphs into Induced Subgraphs. Discrete Applied Mathematics 272 (2020), 31–42. https://doi.org/10.1016/j.dam.2019.01.010 15th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
[20]
S. Lloyd. 1982. Least Squares Quantization in PCM. IEEE Transactions on Information Theory 28, 2 (1982), 129–137. https://doi.org/10.1109/TIT.1982.1056489
[21]
Victor Rodrigo Mercado, Maud Marchal, and Anatole Lecuyer. 2021. Haptics On-Demand: A Survey on Encountered-Type Haptic Displays. IEEE Transactions on Haptics 14, 3 (2021), 449–464.
[22]
Michael Norman, Vince Kellen, Shava Smallen, Brian DeMeulle, Shawn Strande, Ed Lazowska, Naomi Alterman, Rob Fatland, Sarah Stone, Amanda Tan, Katherine Yelick, Eric Van Dusen, and James Mitchell. 2021. CloudBank: Managed Services to Simplify Cloud Access for Computer Science Research and Education. In Practice and Experience in Advanced Research Computing (Boston, MA, USA) (PEARC ’21). Association for Computing Machinery, New York, NY, USA, Article 45, 4 pages. https://doi.org/10.1145/3437359.3465586
[23]
David A. Patterson, Garth Gibson, and Randy H. Katz. 1988. A Case for Redundant Arrays of Inexpensive Disks (RAID). In Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data (Chicago, Illinois, USA) (SIGMOD ’88). Association for Computing Machinery, New York, NY, USA, 109–116. https://doi.org/10.1145/50202.50214
[24]
Markus Rank, Zhuanghua Shi, Hermann J. Müller, and Sandra Hirche. 2010. The Influence of Different Haptic Environments on Time Delay Discrimination in Force Feedback. In Haptics: Generating and Perceiving Tangible Sensations, Astrid M. L. Kappers, Jan B. F. van Erp, Wouter M. Bergmann Tiest, and Frans C. T. van der Helm (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 205–212.
[25]
Kenneth Salisbury, Francois Conti, and Federico Barbagli. 2004. Haptic Rendering: Introductory Concepts. IEEE Computer Graphics and Applications 24, 2 (2004), 24–32.
[26]
S. Voulgaris. 2006. Epidemic-Based Self-Organization in Peer-to-Peer Systems. Ph. D. Dissertation. Vrije Universiteit Amsterdam. Naam instelling promotie: VU Vrije Universiteit Naam instelling onderzoek: ETH.
[27]
Tutte W.1947. The Factorization of Linear Graphs. Journal of London Mathematics Society 22 (1947), 107–11.
[28]
Brian White, Jay Lepreau, Leigh Stoller, Robert Ricci, Shashi Guruprasad, Mac Newbold, Mike Hibler, Chad Barb, and Abhijeet Joglekar. 2002. An Integrated Experimental Environment for Distributed Systems and Networks. SIGOPS Oper. Syst. Rev. 36, SI, 255–270. https://doi.org/10.1145/844128.844152
Index Terms
- An Evaluation of Decentralized Group Formation Techniques for Flying Light Specks
Index terms have been assigned to the content through auto-classification.
Recommendations
Reliability Groups with Standby Flying Light Specks
MMSys '24: Proceedings of the 15th ACM Multimedia Systems ConferenceA Flying Light Speck, FLS, is a miniature sized drone configured with light sources to illuminate different colors and textures. A swarm of FLSs illuminates complex 3D multimedia shapes in a fixed volume, a 3D display. An FLS is a mechanical device. Its ...
Holodeck: Immersive 3D Displays Using Swarms of Flying Light Specks [Extended Abstract]
MMAsia '21: Proceedings of the 3rd ACM International Conference on Multimedia in AsiaUnmanned Aerial Vehicles (UAVs) have moved beyond a platform for hobbyists to enable environmental monitoring, journalism, film industry, search and rescue, package delivery, and entertainment. This paper describes 3D displays using swarms of flying ...
Modeling Illumination Data with Flying Light Specks
MMSys '23: Proceedings of the 14th ACM Multimedia Systems ConferenceA Flying Light Speck, FLS, is a miniature sized drone configured with light sources. Swarms of FLSs will illuminate an object in a 3D volume, an FLS display. These illuminations and their data models are the novel contributions of this paper. We ...
Comments
Information & Contributors
Information
Published In
December 2023
745 pages
ISBN:9798400702051
DOI:10.1145/3595916
Copyright © 2023 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 2024
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- NSF (National Science Foundation)
- CloudLab
- CloudBank
Conference
MMAsia '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 59 of 204 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 240Total Downloads
- Downloads (Last 12 months)240
- Downloads (Last 6 weeks)22
Reflects downloads up to 25 Dec 2024
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML FormatLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in